A paper recommendation mechanism for the research support system Papits

We have developed Papits, a research support system, that shares research information, such as PDF files of research papers, in computers on networks and classifies the information into research types. Papits users can share various research information and survey the corpora of their particular fields. To develop Papits, we need to design a mechanism to identify a user's interest. Also, when constructing an effective paper recommendation system, it is important to carefully create user's models. We propose a method to construct user's models using the scale-free network. The scale-free network has vertices and edges, and ensures growth by 'preference attachments'. Our method applies a paper viewing history to construct a scale-free network based on the word co-occurrence. A constructed network consists of vertices that represent words, and edges that represent the word co-occurrence. In our method, a paper is added to the network as indicated by a user's paper viewing history. Additionally we define the 'topic weight'. By using two elements; the topic frequency and the topic recency, we calculate the topic weight. By using the word co-occurrence in a database, we measure the topic frequency. Also, by using the Jaccard coefficient, we measure the topic recency. Our result indicates that our method can effectively recommend documents for Papits users.

[1]  G. B. A. Barab'asi Competition and multiscaling in evolving networks , 2000, cond-mat/0011029.

[2]  Gerald Salton,et al.  Automatic text processing , 1988 .

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Toramatsu Shintani,et al.  A Method for Information Source Selection using Thesaurus for Distributed Information Retrieval , 2001 .

[5]  Chien Chin Chen,et al.  A Web Document Personalization User Model and System , 2001 .

[6]  Martin F. Porter,et al.  An algorithm for suffix stripping , 1997, Program.

[7]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[8]  Ramon Ferrer i Cancho,et al.  The small world of human language , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[9]  Gerard Salton,et al.  A new comparison between conventional indexing (MEDLARS) and automatic text processing (SMART) , 1972, J. Am. Soc. Inf. Sci..

[10]  S N Dorogovtsev,et al.  Language as an evolving word web , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[11]  Hideaki Takeda,et al.  Experimental Results for a Method to Discover Human Relationship Based on WWW Bookmarks , 2001 .

[12]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[13]  Toramatsu Shintani,et al.  A Logic-based Framework for Mobile Intelligent Information Agents , 2001, WWW Posters.

[14]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[15]  Alistair Moffat,et al.  Vector-space ranking with effective early termination , 2001, SIGIR '01.

[16]  Mitsuru Ishizuka,et al.  Browsing support by highlighting keywords based on a user's browsing history , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[17]  Toramatsu Shintani,et al.  P2P based knowledge source discovery on research support system papits , 2002, AAMAS '02.

[18]  Ginestra Bianconi,et al.  Competition and multiscaling in evolving networks , 2001 .

[19]  Hans Peter Luhn,et al.  A Statistical Approach to Mechanized Encoding and Searching of Literary Information , 1957, IBM J. Res. Dev..

[20]  Toramatsu Shintani,et al.  A Feature Selection for Text Categorization on Research Support System Papits , 2004, PRICAI.