By analyzing the WWW Cache model, we bring forward a user-interest description method based on the fuzzy theory and user-interest inferential relations based on BP（baek propagation） neural network. By this method, t...By analyzing the WWW Cache model, we bring forward a user-interest description method based on the fuzzy theory and user-interest inferential relations based on BP（baek propagation） neural network. By this method, the users＇ interest in the WWW cache can be described and the neural network of users＇ interest can be constructed by positive spread of interest and the negative spread of errors. This neural network can infer the users＇ interest. This model is not the simple extension of the simple interest model, but the round improvement of the model and its related algorithm.展开更多
User interest mining on Sina Weibo is the basis of personalized recommendations,advertising,marketing promotions,and other tasks.Although great progress has been made in this area,previous studies have ignored the dif...User interest mining on Sina Weibo is the basis of personalized recommendations,advertising,marketing promotions,and other tasks.Although great progress has been made in this area,previous studies have ignored the differences among users:the varied behaviors and habits that lead to unique user data characteristics.It is unreasonable to use a single strategy to mine interests from such varied user data.Therefore,this paper proposes an adaptive model for user interest mining based on a multi-agent system whose input includes self-descriptive user data,microblogs and correlations.This method has the ability to select the appropriate strategy based on each user’s data characteristics.The experimental results show that the proposed method performs better than the baselines.展开更多
At present, how to enable Search Engine to construct user personal interest model initially, master user＇s personalized information timely and provide personalized services accurately have become the hotspot in the r...At present, how to enable Search Engine to construct user personal interest model initially, master user＇s personalized information timely and provide personalized services accurately have become the hotspot in the research of Search Engine area. Aiming at the problems of user model＇s construction and combining techniques of manual customization modeling and automatic analytical modeling, a User Interest Model （UIM） is proposed in the paper. On the basis of it, the corresponding establishment and update algorithms of User lnterest Profile （UIP） are presented subsequently. Simulation tests proved that the UIM proposed and corresponding algorithms could enhance the retrieval precision effectively and have superior adaptability.展开更多
We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user inter...We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user interest tree, the content and the structure of which can change simultaneously to adapt to the changes in a user＇s interests. This expression represents a user＇s specific and general interests as a continuurn. In some sense, specific interests correspond to shortterm interests, while general interests correspond to longterm interests. So this representation more really reflects the users＇ interests. The algorithm can automatically model a us er＇s multiple interest domains, dynamically generate the in terest models and prune a user interest tree when the number of the nodes in it exceeds given value. Finally, we show the experiment results in a Chinese Web Site.展开更多
Web-log contains a lot of information related with user activities on the Internet. How to mine user browsing interest patterns effectively is an important and challengeable research topic. On the analysis of the pres...Web-log contains a lot of information related with user activities on the Internet. How to mine user browsing interest patterns effectively is an important and challengeable research topic. On the analysis of the present algorithm’s advantages and disadvantages we propose a new concept: support-interest. Its key insight is that visitor will backtrack if they do not find the information where they expect. And the point from where they backtrack is the expected location for the page. We present User Access Matrix and the corresponding algorithm for discovering such expected locations that can handle page caching by the browser. Since the URL-URL matrix is a sparse matrix which can be represented by List of 3-tuples, we can mine user preferred sub-paths from the computation of this matrix. Accordingly, all the sub-paths are merged, and user preferred paths are formed. Experiments showed that it was accurate and scalable. It’s suitable for website based application, such as to optimize website’s topological structure or to design personalized services. Key words Web Mining - user preferred path - Web-log - support-interest - personalized services CLC number TP 391 Foundation item: Supported by the National High Technology Development (863 program of China) (2001AA113182)Biography: ZHOU Hong-fang (1976-), female.Ph. D candidate, research direction: data mining and knowledge discovery in databases.展开更多
基金Supported bythe Outstanding Young Young Scientist’s Fund ofthe National Natural Science Foundation of China (60303024) ,the National Natu-ral Science Foundation of China (90412003) , National Grand Fundamental Re-search 973 Programof China (2002CB312000) , Doctor Foundation of Ministry ofEducation(20020286004) , Opening Foundation of Jiangsu Key Laboratory of Com-puter Information Processing Technology in Soochow University, Natural ScienceResearch Planfor Jiang Su High School(04kjb520096) ,Doctor Foundatoin of Nan-jing University of Posts and Telecommunications(2003-02)
文摘By analyzing the WWW Cache model, we bring forward a user-interest description method based on the fuzzy theory and user-interest inferential relations based on BP（baek propagation） neural network. By this method, the users＇ interest in the WWW cache can be described and the neural network of users＇ interest can be constructed by positive spread of interest and the negative spread of errors. This neural network can infer the users＇ interest. This model is not the simple extension of the simple interest model, but the round improvement of the model and its related algorithm.
文摘User interest mining on Sina Weibo is the basis of personalized recommendations,advertising,marketing promotions,and other tasks.Although great progress has been made in this area,previous studies have ignored the differences among users:the varied behaviors and habits that lead to unique user data characteristics.It is unreasonable to use a single strategy to mine interests from such varied user data.Therefore,this paper proposes an adaptive model for user interest mining based on a multi-agent system whose input includes self-descriptive user data,microblogs and correlations.This method has the ability to select the appropriate strategy based on each user’s data characteristics.The experimental results show that the proposed method performs better than the baselines.
基金Supported by the National Natural Science Foundation of China (50674086)the Doctoral Foundation of Ministry of Education of China (20060290508)the Youth Scientific Research Foundation of CUMT (0D060125)
文摘At present, how to enable Search Engine to construct user personal interest model initially, master user＇s personalized information timely and provide personalized services accurately have become the hotspot in the research of Search Engine area. Aiming at the problems of user model＇s construction and combining techniques of manual customization modeling and automatic analytical modeling, a User Interest Model （UIM） is proposed in the paper. On the basis of it, the corresponding establishment and update algorithms of User lnterest Profile （UIP） are presented subsequently. Simulation tests proved that the UIM proposed and corresponding algorithms could enhance the retrieval precision effectively and have superior adaptability.
基金Supported by the National Natural Science Funda-tion of China (69973012 ,60273080)
文摘We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user interest tree, the content and the structure of which can change simultaneously to adapt to the changes in a user＇s interests. This expression represents a user＇s specific and general interests as a continuurn. In some sense, specific interests correspond to shortterm interests, while general interests correspond to longterm interests. So this representation more really reflects the users＇ interests. The algorithm can automatically model a us er＇s multiple interest domains, dynamically generate the in terest models and prune a user interest tree when the number of the nodes in it exceeds given value. Finally, we show the experiment results in a Chinese Web Site.
文摘Web-log contains a lot of information related with user activities on the Internet. How to mine user browsing interest patterns effectively is an important and challengeable research topic. On the analysis of the present algorithm’s advantages and disadvantages we propose a new concept: support-interest. Its key insight is that visitor will backtrack if they do not find the information where they expect. And the point from where they backtrack is the expected location for the page. We present User Access Matrix and the corresponding algorithm for discovering such expected locations that can handle page caching by the browser. Since the URL-URL matrix is a sparse matrix which can be represented by List of 3-tuples, we can mine user preferred sub-paths from the computation of this matrix. Accordingly, all the sub-paths are merged, and user preferred paths are formed. Experiments showed that it was accurate and scalable. It’s suitable for website based application, such as to optimize website’s topological structure or to design personalized services. Key words Web Mining - user preferred path - Web-log - support-interest - personalized services CLC number TP 391 Foundation item: Supported by the National High Technology Development (863 program of China) (2001AA113182)Biography: ZHOU Hong-fang (1976-), female.Ph. D candidate, research direction: data mining and knowledge discovery in databases.
