DocumentCode
1938938
Title
An Efficient User Access Pattern Clustering Algorithm
Author
Li, Xin-ye ; Yuan, Jin-sha ; Jing, Yong-Wen
Author_Institution
North China Electr. Power Univ., Baoding
Volume
7
fYear
2007
fDate
19-22 Aug. 2007
Firstpage
4109
Lastpage
4112
Abstract
User access pattern clustering algorithm is researched according to search engine query log. To consider the user access times during clustering process and to get reasonable clustering result, we propose a new Hamming distance computation formula; then the clustering algorithm that uses Hamming distance to measure the similarity is given. After analyzing the algorithm, the result is concluded that this algorithm based on bipartite graph and our Hamming distance computation formula is exact and efficient.
Keywords
pattern clustering; query processing; search engines; Hamming distance; bipartite graph; search engine query log; user access pattern clustering; Bipartite graph; Clustering algorithms; Databases; Hamming distance; Machine learning algorithms; Pattern clustering; Search engines; Sparse matrices; Uniform resource locators; Web pages; Clustering; Hamming distance; Search engine;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2007 International Conference on
Conference_Location
Hong Kong
Print_ISBN
978-1-4244-0973-0
Electronic_ISBN
978-1-4244-0973-0
Type
conf
DOI
10.1109/ICMLC.2007.4370865
Filename
4370865
Link To Document