ACM Home Page
Please provide us with feedback. Feedback
A retrieval method of WEB bulletin board articles using other users' evaluation of past retrieval results
Full text PdfPdf (508 KB)
Source International Conference on Information Integration and web-based Applications and Services archive
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services table of contents
Linz, Austria
WORKSHOP SESSION: iiWAS 2008 workshops: ERPAS 2008: Database and information management table of contents
Pages 587-590  
Year of Publication: 2008
ISBN:978-1-60558-349-5
Authors
Koichi Iwai  Osaka University, Suita, Osaka, Japan
Yohei Sakurai  Osaka University, Suita, Osaka, Japan
Masanori Akiyoshi  Osaka University, Suita, Osaka, Japan
Norihisa Komoda  Osaka University, Suita, Osaka, Japan
Sponsor
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 23,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

Recently, BBS (Bulletin Board System) has frequently used because it contains a lot of users' valuable opinions. However, most users have some frustration when searching target information because BBS has lots of articles and there is no way to retrieve them efficiently and correctly. There are typical retrieval methods, so called "keyword matching" and "similarity-based search in word vector space", but neither of them provide desired retrieval results against incomplete or redundant sentences which are usually expressed in BBS articles. In order to solve this problem, we propose an efficient retrieval method that uses past other users' retrieval results.

In our proposed method, users make two marks whether the retrieval result fits their desired one or not, and such marks are used as feedback for the similar retrieval of other users, which improves the correctness of retrieval results initially derived from "similarity-based search in word vector space". This framework does work well along with users' evaluation.

We made an experiment by our proposed method, and the number of correct answers of ranking TOP10 of retrieval results increases about 50%, and the number of threads that users need to read by finding three desired articles is reduced from 10.6 to 3.2 on average compared with simply use of "similarity-based search in word vector space".


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
Mochihashi Daichi, Kikui Genichiro, and Kita Kenji, "Learning an Optimal Distance Metric in the Linguistic Vector Space," The transactions of the Institute of Electronics, Information and Communication Engineers, Vol. J88-D-II, No. 4(20050401) pp. 747--756, 2005 (in Japanese)
 
2
Miyabe Yasunari, Takamura Hiroya, and Okumura Manabu, "Identifying a cross-document relation between sentences," IEICE technical report. Natural language understanding and models of communication, Vol. 105, No. 203(20050715) pp. 35--42, 2005 (in Japanese)
 
3
Yohei Sakurai, Soichiro Miyazaki, and Masanori Akiyoshi, "A Retrieval Method of Similar Question Articles from Web Bulletin Board", in Proc. of the First International Conference on Software and Data Technologie (ICSOFT-2006), pp. 238--243, 2006
 
4
Takahashi Tetsuro, Inui Kentaro, Matsumoto Yuji, "Methods for Estimating Syntactic Similarity", IPSJ SIG Notes, Vol. 2002, No. 66, pp. 163--170, 2002 (in Japanese)
 
5
 
6

Collaborative Colleagues:
Koichi Iwai: colleagues
Yohei Sakurai: colleagues
Masanori Akiyoshi: colleagues
Norihisa Komoda: colleagues