The Community for Technology Leaders
Web Information Systems Engineering, International Conference on (2001)
Kyoto, Japan
Dec. 3, 2001 to Dec. 6, 2001
ISBN: 0-7695-1393-X
pp: 0245
Hanxiong Chen , University of Tsukuba
Kazutaka Furuse , University of Tsukuba
Nobuo Ohbo , University of Tsukuba
Jeffrey Xu Yu , The Chinese University of Hong Kong
As our early work, we proposed a data mining model for query refinement using Association Rules (ARs) mined among keywords of a large document database. In this paper, first, we explicitly identify principles of a data mining model for query refinement, and show that our model satisfies the principles. Second, we propose a mechanism to reduce the large number of ARs using a concept called "prime keyword". The effectiveness of our approach will be discussed. Considering the fact that most of today's searching engines on the Internet are keyword based, our approach can be easily extended to support Web applications.
Query refinement, AR, Prime keyword, Information retrieval

J. X. Yu, H. Chen, K. Furuse and N. Ohbo, "Support IR Query Refinement by Partial Keyword Set," Proceedings of 2nd International Conference on Web Information Systems Engineering(WISE), Kyoto, Japan, 2001, pp. 0245.
97 ms
(Ver 3.3 (11022016))