Web communities: Analysis and construction

Web Communities: Analysis and Construction

Volumn , Issue , 2006, Pages 1-187

  Zhang, Yanchun ^a   Yu, Jeffrey Xu ^b   Hou, Jingyu ^c  

^a VICTORIA UNIVERSITY   (Australia)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c DEAKIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84891384971     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/3-540-27739-0     Document Type: Book

References (129)

1. The Open Directory Project: Web directory for over 2.5 million URLs, http://www.dmoz.org.
2. Abiteboul, S. (1997). Querying Semi-Structured Data. Proceedings of ICDT, Delphi, Greece.
3. Adamic, L. A. (1999). The Small World Web. Proc. of the 3rd European Conference on Research and Advanced Technology for Digital Libraries (ECDL'99).
4. Arasu, A., Cho J, Garcia-Molina H, Paepcke A, Raghavan S (2000). Searching the Web, Computer Science Department, Stanford University.
5. Asano, Y., H. Imai, M. Toyoda and M. Kitsuregawa (2003). Finding Neighbor Communities in the Web Using Inter-site Graph. Proc. of the 14th International Conference on Database and Expert Systems Applications (DEXA'03).
6. Baeza-Yates, R. and B. Ribeiro-Neto (1999). Modern InformationRetrieval, Addison Wesley, ACM Press.
7. Banter, B. and R. Wille (1999). Formal concept Analysis: mathematical Foundations, Springer Verlag.
8. Berry, M. W., S. T. Dumais and G. W. O'Brien (1995). Using Linear Algebra for Intelligent Information Retrieval. SIAM Review 37(4):573-595.
9. Bharat, K., A. Broder, M. Henzinger, P. Kumar and S. Venkatasubramanian (1998). The Connectivity Server: fast access to linkage information on the Web. Proceedings of the 7th International World Wide Web Conference.
10. Bharat, K. and M. GA (2001). When Experts Agree: Using Non-Affiliated Expertsto Rank Popular Topics. Proceedings of WWW10, Hong Kong.
11. Bharat, K. and M. Henzinger (1998). Improved Algorithms for Topic Distillation in a Hyperlinked Environment. Proc. the 21st International ACM Conference of Research and Development in Information Retrieval (SIGIR98).
12. Borges, J., Levene M (2000). Data Mining of User Navigation Patterns. Web Usage Analysis and User Profiling 1836:92-111.
13. Borodin, A., Roberts G, Rosenthal J and T. P (2001). Finding Authorities and Hubs from Hyperlink Structures on the World Wide Web. Proceedings of the 10th International World Wide Web Conference.
14. Botafogo, R. A. and B. Shneiderman (1991). Identifying Aggregates in Hypertext Structures. Proceedings of Hypertext'91.
15. Bourret, R., C. Bornhovd and A. Buchmann (2000). A Generic Load/Extract Utility for Data Transfer Between XML Documents and Relational Databases. Proceedings of Second International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems (WECWIS'00), Milpitas, California, USA.
16. Brin, S. and L. Page (1998). The Anatomy of a Large-Scale Hypertextual Web Search Engine. Proceedings of the 7th International World Wide Web Conference, Brisbane, Australia.
17. Brin, S. and L. Page. (1998). "The PageRank Citation Ranking: Bringing Order to the Web." Retrieved January, 1998.
18. Brinkmeier, M. (2002). Communities in Graphs. Technical Report, Technical University Ilmenau.
19. Broder, A., S. Glassman, M. Manasse and G. Zweig (1997). Syntactic Clustering of the Web. Proceedings of the 6th International WWW Conference, Santa Clara, CA, USA.
20. Broder, A., R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins and J. Wener (2000). Graph Structure in the Web. Proc. of 9th International World Wide Web Conference.
21. Bron, C. and J. Kerbosch (1973). Algorithm 457 - finding all cliques of an undirected graphBron, C. Communications of the ACM 16(9):575-577.
22. Chakrabarti, S., M. v. d. Berg and B. Dom (1999). Focused crawling: A New Approach to Topic-Specific Web Resource Discovery. Proceedings of the 8th International World Wide Web Conference, Toronto, Canada.
23. Chakrabarti, S., Dom B, Gibson D, Kleinberg J, Raghavan P and Rajagopalan S (1998). Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text. Proceedings of the 7th International World Wide Web Conference.
24. Chakrabarti, S., B. E. Dom, S. R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins, D. Gibson and J. Kleinberg (1999). Mining the Web's Link Structure. Computer: 60-67.
25. Chakrabarti, S., M. M. Joshi, K. Punera and D. M. Pennock (2002). The Structure of Broad Topics on the Web. Proc. of 11th International World Wide Web Conference.
26. Chakrabarti, S., M. van den Berg and B. Dom (1999). Distributed Hypertext Resource Discovery Through Examples. Proceedings of the 25th International Conference on Very Large Data Bases, Edinburgh, Scotland.
27. Chen, C. and L. Carr (1999). Trailblazing the Literature of Hypertext: Author Co-Citation Analysis (1989-1998). Proceedings of the 10th ACM Conference on Hypertext and Hypermedia (Hypertext99).
28. Cho, H., J., Garcia-Molina and L. Page (1998). Efficient Crawling through URL Ordering. Proceedings of the 7th International World Wide Web Conference, gBrisbane, Australia.
29. Cho, J. and H. G.-M. (2000). Synchronizing a Database to Improve Freshness. Proceedings of the ACM SIGMOD International Conference on Management of Data.
30. Cho, J. and H. Garcia-Molina (2000). The Evolution of the Web and Implications for an Incremental Crawler. Proceedings of the 26th International Conference on Very Large Data Bases, Cairo, Egypt.
31. Clarke, C., Cormack G. V. and T. E. A. (2000). Relevance Ranking for One to Three Term Queries. Information Processing & Management (36):291-311.
32. Cohn, D. and C. H (2000). Learning to Probabilistically Identify Authoritative Documents. Proceedings of the 17th International Conference on Machine Learning, Stanford University.
33. Cormen, T. H., C. E. Leiserson and R. L. Rivest (1990). Introduction to Algorithms, The MIT Press.
34. Datta, B. (1995). Numerical Linear Algebra and Application, Brooks/Cole Publishing Company.
35. Dean, J. and M. Henzinger (1999). Finding Related Pages in the World Wide Web. Proc. the 8th International World Wide Web Conference.
36. Deerwester, S., S. T. Dumais, G. W. Furnas, T. K. Landauer and R. Harshman (1990). Indexing by Latent Semantic Analysis. J. Amer. Soc. Info. Sci. 41(6):391-407.
37. Dempster, A. P., N. M. Laird and D. B. Rubin (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal Royal Statist. Soc. B 39(2):1-38.
38. Diligenti, M., F. Coetzee, S. Lawrence, C. Giles and M. Gori (2000). Focused Crawling Using Context Graphs. Proceedings of the 26th International Conference on Very Large Data Bases, Cairo, Egypt.
39. Diligenti, M., Gori M and M. M (2002). Web Page Scoring Systems for Horizontal and Vertical Search. Proceedings of the WWW2002, Honolulu, Hawaii, USA.
40. Dill, S., R. Kumar, K. McCurley, S. Rajagopalan and D. S. a. A. Tomkins (2001). Self-similarity in the Web. Proc. of 27th VLDB Conference.
41. Ding, C., He X, Husbands P, Zha H and S. H (2002). PageRank, HITSand a Unified Framework for Link Analysis. L. B. N. L. T. Report, University of California, Berkeley, CA.
42. Ding, J., L. Gravano and N. Shivakumar (2000). Computing Geographical Scopes of Web Resources. Proc. of the 26th International Conference on Very Large Data Bases (VLDB'00).
43. Duncan, J. and S. H. Watts (1998). Navigation in a small world. Nature 393 (400).
44. Flake, G. W., S. Lawrence and C. L. Giles (2000). Efficient Identification of Web Communities. Proc. of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
45. Flake, G. W., S. Lawrence and C. L. Giles (2002). Self-Organization of the Web and Identification of Communities. IEEE Computer 35 (3).
46. Flake, G. W., R. E. Tarjan and K. Tsioutsiouliklis (2004). Graph Clustering and Minimum Cut Trees. Internet Mathematics 1 (4).
47. Frivolt, G. and M. Bielikova (2005). Topology Generation for Web Communities Modeling. Proc. of the 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2005).
48. Funk, P., A. Lewien and G. Snelting (1998). Algorithms for Concept Lattice Decompositino and their Applications. Technical Report, TU Braunscheweig, FE Informatik.
49. Garfield, E. (1972). Science Citation Analysis as a Tool in Journal Evaluation. 178:471-479.
50. Garfield, E. (1979). Citation Indexing: Its Theory and Application in Science, Technology, and Humanities. New York, John Wiley & Sons.
51. Gibson, D., J. Kleinberg and P. Raghavan (1998). Inferring Web Communities from Link Topology. Proc. of 9th ACM Conference on Hypertext and Hypermedia.
52. Golub, G. H. and C. F. V. Loan (1993). Matrix Computations, second edition, The Johns Hopkins University Press.
53. Greco, G., S. Greco and E. Sumpano (2002). A Stochastic Approach for Modeling and Computing Web Communities. Proc. of the 3rd International Conference on Web Information System Engineering (WISE'02).
54. Han, E., G. Karypis, V. Kumar and B. Mobasher (1998). Hypergraph Based Clustering in High-Dimensional Data Sets: A Summary of Results. IEEE Data Engineering Bulletin 21(1):15-22.
55. Haralick, R. M. (1974). The diclique representation and decomposition of binary relations. Journal of the ACM 21:356-366.
56. Haveliwala, T. (2002). Topic-Sensitive PageRank. Proceedings of WWW02, Honolulu, Hawaii.
57. Hock, R. (2000). The Extreme Searcher's Guide to Web Search Engines: A Hand Book for the Serious Searcher, New Jersey, USA.
58. Hou, J. and Y. Zhang (2002). Constructing Good Quality Web Page Communities. Proceedings of the 13th Australasian Database Conferences (ADC2002), Melbourne, Australia.
59. Hou, J. and Y. Zhang (2003). Effectively Finding Relevant Web Pages from Linkage Information. IEEE Transactions on Knowledge & Data Engineering (TKDE) 15(4):940-951.
60. Hou, J., Y. Zhang, J. Cao, W. Lai and D. Ross (2002). Visual Support for Text Information Retrieval Based on Linear Algebra. Journal of Applied Systems Studies 3 (2).
61. Imafuji, N. and M. Kitsuregawa (2003). Finding a Web Community by Maximum Flow Algorithm with Hits Score Based Capacity. Proc. of the 8th International Conference on Database Systems for Advanced Applications.
62. Imafuji, N. and M. Kitsuregawa (2004). Finding Web Communities by Maximum Flow Algorithm using Well-Assigned Edge Capacities. The IEICE Transactions on Information and Systems E87-D (2).
63. Kamvar, S., Haveliwala TH, Manning CD and G. G. H. (2003). Exploiting the Block Structure of the Web for Computing PageRank, Stanford University.
64. Kamvar, S., H. T. H. and G. G. Manning CD (2003). Extrapolation Methods for Accelerating PageRank Computations. Proceedings of WWW03, Budapest, Hungary.
65. Kleinberg, J. (1998). Authoritative Sources in a Hyperlinked Environment. Proc. of 9th ACM-SIAM Symposium on Discrete Algorithms.
66. Kleinberg, J. (1999). Authoritative Sources in a Hyperlinked Environment. Journal of the ACM 46.
67. Kleinberg, J. (2000). Navigation in a small world. Nature 406 (845).
68. Kleinberg, J. (2002). The Small-World Phenomenon: An Algorithmic Perspective. Proc. of 32nd ACM Symposium on Theory of Computing.
69. Kumar, R., P. Raghavan, S. Rajagopalan and A. Tomkins (1999). Extracting largescale knowledge bases from the Web. Proc. of the 25th VLDB Conference.
70. Kumar, R., P. Raghavan, S. Rajagopalan and A. Tomkins (1999). Trawling the Web for emerging cyber-communities. Proc. of the 8th International World Wide Web Conference.
71. Laender, A. H. F., B. Ribeiro-Neto, A. S. da Silva and E. S. Silva (2000). Representing Web Data as Complex Objects, Electronic Commerce and Web Technologies. Proceedings of the First International Conference, EC-Web 2000, London, UK.
72. Larson, R. (1996). Bibliometrics of the World Wide Web: An Exploratory Analysis of the Intellectual Structure of Cyberspace. Ann. Meeting of the American Soc. Info. Sci.
73. Lawrence, S., C. L. Giles and K. Bollacker (1999). Digital Libraries and Autonomous Citation Indexing. IEEE Computer 36(6):67-71.
74. Lempel, R., Moran S (2001). SALSA The Stochastic Approach for Link-Structure Analysis. ACM Transaction on Information Systems 9(2):131-160.
75. Levene, M., Borges J, Loizou G (2001). Zipf× s Law for Web Surfers. Knowl-edge and Information Systems an International Journal: 3.
76. Li, L., Shang Y and Z. W (2002). Improvement of HITS-based Algorithms on Web Documents. Proceedings of WWW2002, Honolulu, Hawaii, USA.
77. Lifantsev, M. (2000). Voting Model for Ranking Web Pages. Proceedings of the International Conference on Internet Computing, CSREA Press, Las Vegas.
78. Liu, B., Y. Ma and P. S. Yu (2001). Discovering unexpected information from your competitors' Web sites. Proc. of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
79. McBryan, O. A. (1994). GENVL and WWWW: Tools for Taming the Web. Proceedings of the First International World Wide Web Conference, CERN, Geneva, Switzerland.
80. McHugh, J., S. Abiteboul, R. Goldman, D. Quass and J. Widom (1997). Lore: A Database Management System for Semistructured Data. SIGMODRecord 26:54-66.
81. Meng, W., C. Yu and K. Liu (2002). Building Efficient and Effective Metasearch Engines. ACM Computing Surveys: 48-84.
82. Mishra, N., D. Ron and R. Swaminathan (2003). On Finding Large Conjunctive Clusters. Proc. of the 16th Annual Conference on Computational Learning Theory (COLT'03).
83. Mitzenmacher, M. (2004). A Brief History of Generative Models for Power Law and Lognormal Distributions. Internet Mathematics 1(2):226-251.
84. Mobasher, B. (2004). Web Usage Mining and Personalization. Practical Handbook of Internet Computing. M. P. Singh, CRC Press.
85. Mobasher, B., H. Dai, M. Nakagawa and T. Luo (2002). Discovery and Evaluation of Aggregate Usage Profiles for Web Personalization. Data Mining and Knowledge Discovery 6(1):61-82.
86. Mukherjea, S. and Y. Hara (1997). Focus+Context Views of World-Wide Web Nodes. Proceedings of the 8th ACM Conference on Hypertext (Hypertext97).
87. Murata, T. (2000). Discovery of Web Communities Based on the Co-Occurence of References. Proc. of the 3rd International Conference on Discovery Science (DS'00).
88. Murata, T. (2001). A Method for Discovering Purified Web Communities. Proc. of the 4th International Conference on Discovery Science (DS'01).
89. Murata, T. (2003). Discovery of Web Communities from Positive and Negative Examples. Proc. of the 6th International Conference on Discovery Science (DS'01).
90. Najork, M. and J. Wiener (2001). Breadth-first search crawling yields high-quality pages. Proceedings of the 10th International World Wide Web Conference, Hong Kong.
91. Ng, A., Zheng AX and J. M. I. (2001). Stable Algorithms for Link Analysis. Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New Orleans, Louisiana, USA.
92. Ng, A., Zheng AX, Jordan MI (2001). Link Analysis, Eigenvectors and Stability. Proceedings of the 7th International Joint Conference on Artificial Intelligence (IJCAI 01), Seattle, Washington, USA.
93. Ohsawa, Y., H. Soma, Y. Matsuo, N. Matsumura and M. Usui (2002). Featuring Web communities based on word co-occurrence structure of communications. Proc. of the 11th International World Wide Web Conference (WWW11).
94. Otsuka, S., M. Toyoda, J. Hirai and M. Kitsuregawa (2004). Extracting User Behavior by Web Communities Technology on Global Web Logs. Proc. of the 15th International Conference on Database and Expert Systems Applications (DEXA'04).
95. Özsu, M. T. and P. Valduriez (1991). Principle of Distributed Database Systems. Englewood Cliffs, New Jersey, USA, Prentice Hall, Inc.
96. Page, L., Brin S, Motwani R, Winograd T (1998). The Pagerank Citation Ranking: Bringing Order to the Web, Computer Science Department, Stanford University.
97. Papadimitriou, C., P. Raghavan, H. Tamaki and S. Vempala (1997). Latent Semantic Indexing: A Probabilistic Analysis. Proceedings of ACM Symposium on Principles of Database Systems.
98. Papadimitriou, C. H. and K. Steiglitz (1998). Combinatorial Optimization: Algorithms and Complexity, Dover Publications, Inc.
99. Papakonstantinou, Y., H. Garcia-Molina and J. Widom (1995). Object Exchange Across Heterogenous Information Sources. Proceedings of the Eleventh International Conference on Data Engineering, Taipei, Taiwan.
100. Pennock, D. M., G. W. Flake, S. Lawrence, E. J. Glover and C. L. Giles (2002). Winners don't take all: Characterizing the competition for links on the Web. Proc. of the National Academy of Sciences.
101. Perkowitz, M. and O. Etzioni (1998). Adaptive Web Sites: Automatically Synthesizing Web Pages. Proceedings of the 15th National Conference on Artificial Intelligence, Madison, WI, AAAI.
102. Pierrakos, D., G. Paliouras, C. Papatheodorou, V. Karkaletsis and M. D. Dikaiakos (2003). Construction of Web Community Directories by Mining Usage Data. Proc. of the 2nd Hellenic Data Management Symposium (HDMS'03).
103. Pierrakos, D., G. Paliouras, C. Papatheodorou, V. Karkaletsis and M. D. Dikaiakos (2003). Web Community Directories: A New Approach to Web Personalization. Proc. of the 1st European Web Mining Forum (EWMF'03).
104. Pitkow, J. and P. Pirolli (1997). Life, Death, and Lawfulness on the Electronic Frontier. Proceedings of ACM SIGCHI Conference on Human Factors in Computing (CHI 97).
105. Reddy, P. K. and M. Kitsuregawa (2001). An approach to relate the Web communities through bipartite graphs. Proc. of the 2nd International Conference on Web Information Systems Engineering (WISE'01).
106. Rennie J. and A. McCallum (1999). Using Reinforcement Learning to Spider the Web Efficiently. Proceedings of the International Conference on Machine Learning (ICML).
107. Richardson, M., Domingos P (2002). The Intelligent Surfer: Probabilistic Combination of Link and Content Information in PageRank. 14.
108. Rome, J. E. and R. M. Haralick (2005). Towards a Formal Concept Analysis Approach to Exploring Communities on the World Wide Web. Proc. of the 3rd International Conference on Formal Concept Analysis (ICFCA'05).
109. Salton, G. and M. M. J. (1983). Introduction to Modern Information Retrieval. New York, NY, McGraw-Hill.
110. Sha, F., G. Gardarin and L. Nemirovski (2000). Managing Semistructured Data in Object-Relational DBMS. Networking and Information Systems Journal, Vol. 1 (1).
111. Shivakumar N., H. G.-M. (1998). Finding Near-Replicas of Documents on the Web. Workshop on Web Databases. Valencia, Spain.
112. Sonnenreich, W. and T. Macinta (1998). Web Developer. Com Guide to Search Engines, ohn Wiley & Sons, Inc., USA.
113. Stewart, G. and S. J. G. (1990). Matrix Perturbation Theory, Academic Press.
114. Strang, G. (1993). Introduction to Linear Algebra, Wellesley-Cambridge Press.
115. Surjanto, B., N. Ritter and H. Loeser (2000). XML Content Management based on Object-Relational Database Technology. Proceedings of the 1st International Conference on Web Information Systems Engineering (WISE2000), Hong Kong, China.
116. Talim, J., Z. Liu, P. Nain and E. Coffman (2001). Controlling Robots of Web Search Engines. Proceedings of SIGMETRICS Conference.
117. Tawde, V. B., T. Oates and E. Glover (2004). Generating Web Graphs with Embedded Communities. Proc. of 3rd Workshop on Algorithms and Models for the Web-Graph (WAW 2004).
118. Toyoda, M. and M. Kitsuregawa (2001). Creating a Web Community Chart for Navigating Related Communities. Proc. of the 12th ACM Conference on Hypertext and Hypermedia (Hypertext'01).
119. Toyoda, M. and M. Kitsuregawa (2003). Extracting Evolution of Web Communities from a Series of Web Archives. Proc. of the 14th ACM Conference on Hypertext and Hypermedia (HT'03).
120. Trefethen, L. and B. D (1997). Numerical Linear Algebra. Phila-delphia, SIAM Press.
121. Wang, L. (1997). On Competitive Learning. IEEE Transaction on Neural Networks 8(5):1214-1217.
122. Wang, M. (2002). A Significant Improvement to Clever Algorithm in Hyper-linked Environment. Proceedings of the 11th International World Wide Web Conference (WWW2002), Honolulu, Hawaii, USA.
123. Wang, Y. and M. Kitsuregawa (2001). Use Link-based Clustering to Improve Web Search Results. Proceedings of the 2nd International Conference on Web Information Systems Engineering (WISE2001), Kyoto, Japan.
124. Weiss, R., B. Vélez, M. A. Sheldon, C. Namprempre, P. Szilagyi, A. Duda and D. K. Gifford. (1996). HyPursuit: A Hierarchical Network Search Engine that Exploits Content-Link Hypertext Clustering. Proceedings of the Seventh ACM Conference on Hypertext.
125. Wen, C. W., H. Liu, W. X. Wen and J. Zheng (2001). A Distributed Hierarchical Clustering System for Web Mining. Proceedings of the Second International Conference on Web-Age Information Management (WAIM2001), Xi'An, China.
126. Wilkinson, R., Zobel J. J. and S.-D. R. D. (1995). Similarity Measures for Short Queries. Proceedings of the Fourth Text Retrieval Conference (TREC-4), Gaithersburg, MD.
127. Xu, G., Y. Zhang, J. Ma and X. Zhou (2005). Discovering User Access Pattern Based on Probabilistic Latent Factor Model. Proceeding of 16th Australasian Database Conference, Newcastle, Australia, ACS Inc.
128. Xu, G., Y. Zhang and X. Zhou (2005). Using Probabilistic Semantic Latent Analysis for Web Page Grouping. 15th International Workshop on Research Issues on Data Engineering: Stream Data Mining and Applications (RIDE-SDMA'2005), Tyoko, Japan.
129. Yoon, J. P. and V. Raghavan (2000). Multi-Level Schema Extraction for Heterogeneous Semi-Structured Data. Proceedings of the First International Conference on Web-Age Information Management (WAIM'00), Shanghai, China.