The Community for Technology Leaders
Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on (2008)
Dec. 9, 2008 to Dec. 12, 2008
ISBN: 978-0-7695-3496-1
pp: 685-689
This thesis presents a novel two-stage model that integrates the theories and techniques from the fields of information retrieval/filtering (IR/IF)and the fields of machine learning and data mining to provide more precise document filtering and retrieval. The first stage is topic filtering. The topic filtering stage is intended to minimize information mismatch by filtering out the most likely irrelevant information based on term-based profiles. Thus, only a relatively small amount of potentially highly relevant documents remain for document ranking. The second stage of the presented method uses pattern mining approach. The objective of the second stage is to solve the problem of information overload. The most likely relevant documents were assigned higher ranks by exploiting patterns in the pattern taxonomy. The second stage is precision oriented. Since relatively small amount of documents are involved at this stage, computational cost is markedly reduced, at the same time, with significant improved results. The new two-stage information filtering model has been evaluated by extensive experiments. The tests were based on well-known IR bench-marking processes, using the latest version of the Reuters dataset, namely Reuters Corpus Volume 1 (RCV1). The performance of the new model was compared with both of the term-based and data mining-based IF models. The results show that more effective and efficient information access has been achieved by combining the strength of information filtering and data mining method.
information retrieval, information filtering, user profile, data mining, sequential pattern mining

P. Bruza, R. Y. Lau, X. Zhou, Y. Xu and Y. Li, "Two-Stage Model for Information Filtering," Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on(WI-IAT), vol. 03, no. , pp. 685-689, 2008.
82 ms
(Ver 3.3 (11022016))