{"title":"Internet-Based Researcher Interest Mining","authors":"Song Kang, Nanchang Cheng","doi":"10.1109/DSA.2019.00011","DOIUrl":null,"url":null,"abstract":"In today's knowledge-based economy society, the rapid spread of a trend, personalized knowledge service has become the mainstream of development, so that the Web information users can meet the variety, high level of precision and content requirements of the high-level service form. Through analysis, we can find that the mining of researchers' interest can serve as the main learning content of personalized knowledge services. So the realization of research interest mining based on Internet is to meet the special information needs of the users, which can be called an effective method to optimize the content of personalized business. Therefore, a more effident algorithm is used to optimize the search search program for Internet information and improve the search efficiency. This optimization can become the research direction of the present age of all things in the world. The information data mining strategy to the simple to can improve the information retrieval efficiency of the network resources, and can provide the accurate, reliable summary of the Internet information resources, meet the convenience and precision of the researchers to retrieve the Internet information resources, thus can be accurate and high. The research interest mining based on the Internet includes the use of search engines to obtain the relevant information of the researchers. Through data mining and machine learning algorithms, the results information returned by the search engine are analyzed, and the research interests of the researchers are obtained from the contents of these results.","PeriodicalId":342719,"journal":{"name":"2019 6th International Conference on Dependable Systems and Their Applications (DSA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 6th International Conference on Dependable Systems and Their Applications (DSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSA.2019.00011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In today's knowledge-based economy society, the rapid spread of a trend, personalized knowledge service has become the mainstream of development, so that the Web information users can meet the variety, high level of precision and content requirements of the high-level service form. Through analysis, we can find that the mining of researchers' interest can serve as the main learning content of personalized knowledge services. So the realization of research interest mining based on Internet is to meet the special information needs of the users, which can be called an effective method to optimize the content of personalized business. Therefore, a more effident algorithm is used to optimize the search search program for Internet information and improve the search efficiency. This optimization can become the research direction of the present age of all things in the world. The information data mining strategy to the simple to can improve the information retrieval efficiency of the network resources, and can provide the accurate, reliable summary of the Internet information resources, meet the convenience and precision of the researchers to retrieve the Internet information resources, thus can be accurate and high. The research interest mining based on the Internet includes the use of search engines to obtain the relevant information of the researchers. Through data mining and machine learning algorithms, the results information returned by the search engine are analyzed, and the research interests of the researchers are obtained from the contents of these results.