An interest-based clustering method for web information visualization

被引：1

作者：

Saleheen, Shib Li ^{[1
]}

Lai, Wei ^{[1
]}

机构：

[1] Engineering and Technology, Swinburne University of Technology, Hawthorn, VIC

来源：

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2014年 / 8933卷

关键词：

Clustering; User Interests; Visualization; Web Networks;

D O I：

10.1007/978-3-319-14717-8_33

中图分类号：

学科分类号：

摘要：

Web graph is a tool to visualize web information as network. It unfurls inherent connectivity of the web for end users from a different viewpoint. The enlarged size of the web causes the information overload problem and forces the wide use of compression techniques such as filtering and clustering on graphs during presentation of web information. In addition, the Internet users, their intentions and activities on the web differ. User interest-based web graph, which is modulated by user interests during construction, is used to accommodate differences over end users and/or their needs. However, user interest-based web graph features an unorthodox way to present connectivities among nodes by utilizing edge labels. This complicates further operations such as clustering and focused visualization on web graphs. This paper introduces a novel approach to cluster user interest-based web graphs by adopting the divide and conquer strategy. It is demonstrated that, this approach can effectively cluster the user interest-based web graph. © Springer International Publishing Switzerland 2014.

引用

页码：421 / 434

页数：13

共 14 条

[1]

Avrachenkov K., Dobrynin V., Nemirovsky D., Pham S.K., Smirnova E., Pagerank based clustering of hypertext document collections, SIGIR, pp. 873-874, (2008)

[2]

Bekkerman R., Zilberstein S., Allan, J.:Web page clustering using heuristic search in the web graph, IJCAI, pp. 2280-2285, (2007)

[3]

Brisaboa N.R., Ladra S., Navarro G., Compact representation of web graphs with extended functionality, Inf. Syst, 39, pp. 152-174, (2014)

[4]

Hartigan J.A., Clustering Algorithms, (1975)

[5]

Huang X., Lai W., Clustering graphs for visualization via node similarities, J. Vis. Lang. Comput, 17, 3, pp. 225-253, (2006)

[6]

Jain A.K., Data clustering: 50 years beyond k-means, 31, 8, pp. 651-666, (2010)

[7]

Lin D., An information-theoretic definition of similarity, ICML, pp. 296-304, (1998)

[8]

Manning C.D., Raghavan P., Schutze H., Introduction to information retrieval, 1, (2008)

[9]

Meyerhenke H., Sanders P., Schulz C., Partitioning complex networks via sizeconstrained clustering, CoRR abs/1402, (2014)

[10]

Rattigan M.J., Maier M., Jensen D., Graph clustering with network structure indices, ICML, pp. 783-790, (2007)

← 1 2 →