The week's pick
Reseach Article
Recuperating Link Structure of Website using MST
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 48 - Number 5 |
| Year of Publication: 2012 |
| Authors: Prateek Dwivedi, Pushkar Singh Negi, Raj Gaurang Tiwari |
10.5120/7341-9721
|
Prateek Dwivedi, Pushkar Singh Negi, Raj Gaurang Tiwari . Recuperating Link Structure of Website using MST. International Journal of Computer Applications. 48, 5 ( June 2012), 1-6. DOI=10.5120/7341-9721
Abstract
With the explosive growth of information sources available on the World Wide Web, it has become increasingly necessary for users to utilize automated tools in find the desired information resources, and to track and analyze their usage patterns. These factors give rise to the necessity of creating server side and client side intelligent systems that can effectively mine for knowledge. Web mining can be broadly defined as the discovery and analysis of useful information from the World Wide Web. Our aim is to utilize the concept of using an efficient MST approach to assist easier web navigation with involvement of clustering concept. In this paper we analyze and thereby make use of implementing the same concept in it, which works on the fact of constructing a minimum spanning tree of a point set i. e. nodes and removes edges that satisfy a predefined criterion.
References
- C. Zahn, 2011, "Graph theoretical methods for detecting and describing gestalt clusters" .
- D. Avis,1986, "Diameter Partitioning", Discrete and Computational Geometry.
- Jianhan Zhu, 2003,Mining Website Link structures for Adaptive website navigation and Search.
- Miguel Gomes da Costa Junior, Zhiguo Gong,2005, Web Structure Mining: an Introduction.
- Margaret H. Dunham,2003, "Data Mining Introductory and Advance Topics", Low price Edition – Pearson Education, Delhi.
- Oleksandr Grygorash, Yan Zhou, Zach Jorgensen, Minimum Spanning tree Based clustering Algorithms
- Pedro F. Felzenszwalb, Daniel P. Huttenlocher, Efficient Graph-Based Image Segmentation.
- Ramakrishnam Raju, Valli Kumari, 2011,Comparison of parameter free clustering algorithm with hierarchical agglomerative clustering Algorithms.
- Ricardo Baeza –Yates ET. Al. 2005, WIM: an Information Mining Model for the Web.
- S. P. Victor, S. J. Peter,2005-10, A Novel Algorithm for Minimum Spanning Clustering Tree.
- S. P. Victor, S. J. Peter, 2010,A Novel Algorithm for Informative Meta Similarity Clusters Using Minimum Spanning Tree.
- S. P. Victor, S. J. Peter, 2010,A Novel Minimum Spanning Tree Based Clustering Algorithm for Image Mining.
- S. Chidambaranathan, S. J. Peter, 2011,Detection of Outlier-Communities Using Minimum Spanning Tree.
- Soumen Chakrabarti, Byron E. Dom ET. Al. ,1999, Mining the link structure of the World Wide Web.
- T. Asano, B. Bhattacharya, M. Keil, F. Yao,1988, Clustering algorithms based on minimum and maximum spanning trees.
- T. Karthikeyan, S. J. Peter, 2011,Outlier Removal Clustering through Minimum Spanning Tree.
- Wenpu Xing, Ali Ghorbani, Weighted PageRank Algorithm.
- William B. March, Parikshit Ram, Alexander G. Gray, Fast Euclidean Minimum spanning tree:Algorithm,Analysis and Applications.
Index Terms
Keywords