Folksonomical P2P File Sharing Networks Using Vectorized KANSEI Information as Search Tags

• OHNISHI Kei

  Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology

• YOSHIDA Kaori

  Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology

• OIE Yuji

  Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology

抄録

We present the concept of folksonomical peer-to-peer (P2P) file sharing networks that allow participants (peers) to freely assign structured search tags to files. These networks are similar to folksonomies in the present Web from the point of view that users assign search tags to information distributed over a network. As a concrete example, we consider an unstructured P2P network using vectorized Kansei (human sensitivity) information as structured search tags for file search. Vectorized Kansei information as search tags indicates what participants feel about their files and is assigned by the participant to each of their files. A search query also has the same form of search tags and indicates what participants want to feel about files that they will eventually obtain. A method that enables file search using vectorized Kansei information is the Kansei query-forwarding method, which probabilistically propagates a search query to peers that are likely to hold more files having search tags that are similar to the query. The similarity between the search query and the search tags is measured in terms of their dot product. The simulation experiments examine if the Kansei query-forwarding method can provide equal search performance for all peers in a network in which only the Kansei information and the tendency with respect to file collection are different among all of the peers. The simulation results show that the Kansei query forwarding method and a random-walk-based query forwarding method, for comparison, work effectively in different situations and are complementary. Furthermore, the Kansei query forwarding method is shown, through simulations, to be superior to or equal to the random-walk based one in terms of search speed.

収録刊行物

• IEICE Transactions on Information and Systems

  IEICE Transactions on Information and Systems E92-D (12), 2402-2415, 2009

  一般社団法人 電子情報通信学会

キーワード

• P2P file sharing
• folksonomy
• query forwarding
• Kansei
• human

詳細情報

• CRID: 1390001204379153536
• NII論文ID: 10026812554
• NII書誌ID: AA10826272
• DOI: 10.1587/transinf.e92.d.2402
• ISSN: 17451361
• ISSN: 09168532
• Web Site: http://www.jstage.jst.go.jp/article/transinf/E92.D/12/E92.D_12_2402/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可