Finding Community Base on Web Graph Clustering


1 Assistant professor of Department of Mechatronic Engineering, Faculty of New Science And Technologies, University of Tehran, Tehran,IRAN,

2 Student of computer software technology, Hashtgerd University, Hashtgerd, Alborz, IRAN.City: Tehran,


Search Pointers organize the main part of the application on the Internet. However, because of Information management hardware, high volume of data and word similarities in different fields the most answers to the user s’ questions aren`t correct. So the web graph clustering and cluster placement in corresponding answers helps user to achieve his or her intended results. Community (web communities) can be used to generate automated directory services. In this paper the act of clustering has been done by finding the complete bipartite sub- graphs. The sub- graphs form the core of a community or clustering and by extending the core we can attain to the whole clustering .The whole set of graphs in England are 18 million pages and 300 million links


Ron Bekkerman, Shlomo Zilberstein, James Allan, “Web Page Clustering using Heuristic Search in the Web Graph”, Morgan Kaufmann Publishers Inc. San Francisco, CA, USA, 2007
[2] msglaz2.htm. 420-425
Anjali B. Raut, G. R. Bamnote, “ Web Document Clustering Using Fuzzy Equivalence Relations”, Journal of Emerging Trends in Computing and Information Sciences, CIS Journal, 2010-11.
Ricardo Baeza-Yates and Berthier Ribeiro-Neto., “Modern Information Retrieval”, ACM Press/ Addison-Wesley, 1999.
Tomoe Tomiyama, Ryosuke Ohgaya, Akiyoshi Shinmura, Takayuki Kawabata, Tomohiro Takagi, and M. Nikravesh, “Concept-Based Web Communities for Google Search Engine”, The IEEE International Conference on Fuzzy Systems, May 25-28, 2003.
Choi, D.-Y., “Enhancing the Power of Web Search Engines by Means of Fuzzy Query”, Decision Support Systems, Vol.35, No.1, pp.31-44, 2003.
Chris Ding, Xiaofeng He, “K-means Clustering via Principal Component Analysis”, ACM Press, 2004.
V. Loia a,b, W. Pedrycz c,*, S. Senatore, “A P-FCM: a Proximity-Based Fuzzy Clustering for User-Centered web applications, International Journal of Approximate Reasoning, Vol.34, pp.121–144, 2003.
G. W. Flake, S. Lawrence, and C. L. Giles. Ecient Identification of Web Communities”, In Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD-2000), pp.150-160, NewYork: ACM Press, 2000.
S.R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. “Trawling the Web for Emerging Cyber-Communities.” In Proceedings of the 8th International World Wide Web Conference, pp.11-16. Amsterdam: Elsevier Science, 1999.
International Journal of Smart Electrical Engineering, Vol.2, No.3, Summer 2013 ISSN: 2251-9246
W. E. Donath and A. J. “Lower Bounds for the Partitioning of Graphs.” IBM Journal of Research and Development, Vol.17, 1973.
Jon Kleinberg. “Authoritative Sources in a Hyperlinked Environment”, In Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, pp.668-677, New York: ACM Press, 1998.
S. Brin and L. Page. “Anatomy of a Large-Scale Hypertextual Web Search Engine”, In Proc. 7th International World Wide Web Conference, pp.107-117, New York: ACM Press, 1998.
Gary William Flake, Robert E. Tarjan and Kostas,”Graph Clustering and Minimum Cut Trees”, Internet Mathematics Journal, Vol.1, No.4, Publication Date:2003/2004.