ACM Home Page
Please provide us with feedback. Feedback
Keyword search considering user's preference in P2P networks
Full text PdfPdf (3.86 MB)
Source Conference On Ubiquitous Information Management And Communication archive
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication table of contents
Suwon, Korea
SESSION: Data analysis and mining I table of contents
Pages 432-440  
Year of Publication: 2009
ISBN:978-1-60558-405-8
Authors
Tomomi Miyazaki  Osaka Univ., Suita, Osaka, Japan
Toshiki Watanabe  Osaka Univ., Suita, Osaka, Japan
Akimitsu Kanzaki  Osaka Univ., Suita, Osaka, Japan
Takahiro Hara  Osaka Univ., Suita, Osaka, Japan
Shojiro Nishio  Osaka Univ., Suita, Osaka, Japan
Sponsor
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 37,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1516241.1516317
What is a DOI?

ABSTRACT

When a user searches data in a P2P network, it is general to use a keyword-search, which acquires data items whose keywords match keywords the user specified. In a naive keyword-search strategy, however, users usually get a large number of data items regardless whether they actually need these data items or not because this strategy returns data items without considering the user's preference. In this paper, we propose a novel search strategy considering user's preference in P2P networks. In our strategy, each peer predicts the user's preference based on keywords featured in the data items. When searching, a peer appends some additional keywords representing the user's preference to the query in addition to the keyword that the user specifies. Peers which receive the query calculate the similarity between their holding data items and the information on the user's preference appended by the query sender. As a result, if the similarity is high, the peer returns its holding data items whose keywords match the received query. Thus, users can avoid getting unnecessary data items. In addition, each peer learns the user's preference using keywords featured in data items that the user accesses.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
W. R. Hersh, S. Price, and L. Donohoe. Assessing thesaurus-based query expansion using the umls metathesaurus. In AMIA, pages 344--348, 2000.
 
4
5
 
6
G. Salton and C. Buckley. Improving retrieval performance by relevance feedback. In Journal of the American Society for Information Science, pages 288--297, 1990.
 
7
 
8
 
9
G. K. Zipf. Human Behavior and the Principle of Least Effort. Addison-Wesley, Cambridge, MA, 1949.

Collaborative Colleagues:
Tomomi Miyazaki: colleagues
Toshiki Watanabe: colleagues
Akimitsu Kanzaki: colleagues
Takahiro Hara: colleagues
Shojiro Nishio: colleagues