A unified expanding method for content-ignorant web page clustering

Author

Chen, Chen

Author_Institution

Sch. of Electron. Eng. & Comput. Sci., Peking Univ., Beijing

fYear

2008

fDate

25-27 June 2008

Firstpage

633

Lastpage

638

Abstract

The content-ignorant clustering method takes advantages in time complexity and space complexity.. than the content based methods. In this paper, the authors introduce a unified expanding method for content-ignorant Web page clustering by mining the ldquoclickthroughrdquo log, which tries to solve the problem that the ldquoclickthroughrdquo log is sparse. The relationship between two nodes which have been expanded is also defined and optimized. Analysis and experiment show that the performance of the new method has improved, by the comparison with the standard content-ignorant method. The new method can also work without iterative clustering.

Keywords

Internet; computational complexity; data mining; pattern clustering; clickthrough log; content-ignorant Web page clustering; mining; space complexity; time complexity; unified expanding method; Automation; Bismuth; Clustering methods; Computer science; Data mining; Intelligent control; Optimization methods; Performance analysis; Uniform resource locators; Web pages; clustering; content-ignorant clustering; web data mining;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on

Conference_Location

Chongqing

Print_ISBN

978-1-4244-2113-8

Electronic_ISBN

978-1-4244-2114-5

Type

conf

DOI

10.1109/WCICA.2008.4592996

Filename

4592996