Rough Document Clustering and the Internet

Handbook of Granular Computing

Volumn , Issue , 2008, Pages 987-1003

  Nguyen, Hung Son ^a   Ho, Tu Bao ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Determining cluster representatives; Rough document clustering and Internet; Rough set document clustering approach; Rough sets and tolerance rough set model; Text mining TRS model; TRSM based snippets clustering algorithm; Web search engines query formulation

Indexed keywords

EID: 84889387072     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470724163.ch47     Document Type: Chapter

References (29)

1. A. Bargiela and W. Pedrycz. Granular Computing. An Introduction. The International Series in Engineering and Computer Science, Vol. 717. Kluwer Academic Publishers, Boston, MA, 2002.
2. Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer, Dordrecht, 1991.
3. Z. Pawlak. Granularity of knowledge indiscernibility and rough sets. In: Proceedings of the 1998 IEEE International Conference on Computational Intelligence, Vol. 1, Anchorage, AK, May 04-09, 1998, pp. 106-110.
4. L.T. Polkowski and A. Skowron. Towards adaptive calculus of granules. In: Proceedings of the FUZZ-IEEE International Conference, 1998 IEEE World Congress on Computational Intelligence (WCCI'98) , Anchorage, Alaska, USA, May 5-9, 1998, pp. 111-116.
5. H.S. Nguyen, A. Skowron, and J. Stepaniuk. Granular computing: a rough set approach. Comput. Intell. Int. J. 17(3) (2001) 514-544.
6. J.F. Peters, A. Skowron, Z. Suraj, W. Rzasa, and M. Borkowski. Clustering: A rough set approach to constructing information granules. In: Soft Computing and Distributed Processing, Proceedings of 6th International Conference, SCDP 2002, IOS Press, Amsterdam, The Netherlands, pp. 57-61.
7. S. Asharaf, S.K. Shevade, and N.M. Murty. Rough support vector clustering. Pattern Recognit. 38(10) (2005) 1779-1783.
8. P. Lingras. Unsupervised rough set classification using GAs. J. Intell. Inf. Syst. 16(3) (2001) 215-228.
9. K.E. Voges, N.K.L.I. Pope, and M.R. Brown. Cluster analysis of marketing data: A comparison of k-means, rough set, and rough genetic approaches. In: H.A. Abbas, R.A. Sarker, and C.S. Newton (eds) , Heuristics and Optimization for Knowledge Discovery. Idea Group Publishing, Hershey, PA, pp. 208-216.
10. P. Lingras, M. Hogo, and M. Snorek. Interval set clustering of web users using modified Kohonen self-organizing maps based on the properties of rough sets. Web Intell. Agent Syst. Int. J. 2(3) (2004) 217-230.
11. S. Hirano and S. Tsumoto. Rough clustering and its application to medicine. J. Inf. Sei. 124 (2000) 125-137.
12. P. Lingras and C. West. Interval set clustering of web users with rough k-means. J. Intell. Inf. Syst. 23(1) (2004) 5-16.
13. M.A. Hearst and J.O. Pedersen. Reexamining the cluster hypothesis: Scatter/gather on retrieval results. In: Proceedings of SIGIR-96, 19th ACM International Conference on Research and Development in Information Retrieval, Zürich, CH, 1996, pp. 76-84.
14. O. Zamir and O. Etzioni. Grouper: A dynamic clustering interface to web search results. Comput. Netw. (Amsterdam, Netherlands: 1999) 31(11-16) (1999) 1361-1374.
15. D.Weiss. A Clustering Interface forWeb Search Results in Polish and English. Master's Thesis. Poznan University of Technology, Poland, June 2001.
16. S. Osinski. An Algorithmfor Clustering of Web Search Result. Master's Thesis, Poznan University of Technology, Poland, June 2003.
17. S. Osinski and D. Weiss. A concept-driven algorithm for clustering search results. IEEE Intell. Syst. 20(3) (2005) 48-54.
18. M. Wróblewski. A Hierarchical WWW Pages Clustering Algorithm Based on the Vector Space Model. Master's Thesis. Poznan University of Technology, Poland, July 2003.
19. S. Kawasaki, N.B. Nguyen, and T.B. Ho. Hierarchical document clustering based on tolerance rough set model. In: D.A. Zighed, H.J. Komorowski, and J.M. Zytkow (eds) , Principles of Data Mining and Knowledge Discovery, 4th European Conference, PKDD 2000, Lyon, France, September 13-16, 2000, Proceedings (2000) . Vol. 1910 of Lecture Notes in Computer Science. Springer-Verlag, London, UK, pp. 458-463.
20. T.B. Ho and N.B. Nguyen. Nonhierarchical document clustering based on a tolerance rough set model. Int. J. Intell. Syst. 17(2) (2002) 199-212.
21. J. Komorowski, Z. Pawlak, L. Polkowski, and A. Skowron. Rough sets: A tutorial. In: S. Pal and A. Skowron (eds) , Rough Fuzzy Hybridization. Springer-Verlag, Berlin, Heidelberg, 1998, pp. 3-98.
22. A. Skowron and J. Stepaniuk. Tolerance approximation spaces. Fundam. Inf. 27(2-3) (1996) 245-253.
23. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval, 1st ed. Addison-Wesley Longman Publishing Co. Inc., Boston, MA, 1999.
24. F.A. Smadja. From n-grams to collocations: An evaluation of xtract. In: 29th Annual Meeting of the Associationfor Computational Linguistics, June 18-21, 1991, University of California, Berkeley, California, USA, Proceedings, 1991, pp. 279-284.
25. J. Han and M. Kamber. Data Mining: Concepts and Techniques, 2nd ed. Morgan Kaufmann, San Francisco, CA, 2006.
26. M.F. Porter. An algorithm for suffix stripping. In: P.W. Karen and S. Jones (eds) , Readings in Information Retrieval, Morgan Kaufmann, San Francisco, 1997, pp. 130-137.
27. G. Salton. Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley Longman Publishing Co., Inc., Reading, MA, 1989.
28. C.L. Ngo and H.S. Nguyen. A method of web search result clustering based on rough sets. In: A. Skowron, R. Agrawal, M. Luck, T. Yamaguchi, P. Morizet-Mahoudeaux, J. Liu, and N. Zhong (eds) , 20051EEE/WIC/ACM International Conference on Web Intelligence (W12005) , September 19-22, 2005, Compiegne, France, IEEE Computer Society, Los Alamitos, CA, pp. 673-679.
29. S. Osinski and D. Weiss. Carrot: Design of a flexible and efficient web information retrieval framework. In: P.S. Szczepaniak, J. Kacprzyk, and A. Niewiadomski (eds) , AWIC (2005) , Vol. 3528 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, 2005, pp. 439-444.