198 References49. D. Chakrabarti, R. Kumar, <strong>and</strong> A. Tomkins. Evolutionary clustering. In KDD ’06: Proc<strong>ee</strong>dingsof the 12th ACM SIGKDD international conference on Knowledge discovery<strong>and</strong> data mining, pages 554–560, New York, NY, USA, 2006. ACM.50. S. Chakrabarti. Data mining for hypertext: a tutorial survey. SIGKDD Explor. Newsl.,1(2):1–11, 2000.51. S. Chakrabarti. Integrating the document object model with hyperlinks for enhancedtopic distillation <strong>and</strong> information extraction. In WWW ’01: Proc<strong>ee</strong>dings of the 10thinternational conference on World Wide <strong>Web</strong>, pages 211–220, New York, NY, USA,2001. ACM.52. S. Chakrabarti. Integrating the document object model with hyperlinks for enhancedtopic distillation <strong>and</strong> information extraction. In Proc<strong>ee</strong>dings of the 10th internationalconference on World Wide <strong>Web</strong>(WWW’01), pages 211–220, 2001.53. S. Chakrabarti. <strong>Mining</strong> the <strong>Web</strong>: Discovering Knowledge from Hypertext Data. Morgan-Kauffman, 2002.54. S. Chakrabarti, B. Dom, <strong>and</strong> P. Indyk. Enhanced hypertext categorization using hyperlinks.In Proc<strong>ee</strong>dings of ACM SIGMOD International Conference on Management ofData (SIGMOD’98), pages 307–318, Seattle, Washington, USA, 1998.55. S. Chakrabarti, B. Dom, P. Raghavan, S. Rajagopalan, D. Gibson, <strong>and</strong> J. Kleinberg.Automatic resource compilation by analyzing hyperlink structure <strong>and</strong> associated text.In WWW7: Proc<strong>ee</strong>dings of the seventh international conference on World Wide <strong>Web</strong> 7,pages 65–74, Amsterdam, The Netherl<strong>and</strong>s, The Netherl<strong>and</strong>s, 1998. Elsevier SciencePublishers B. V.56. S. Chakrabarti, M. M. Joshi, K. Punera, <strong>and</strong> D. M. Pennock. The structure of broadtopics on the web. In WWW ’02: Proc<strong>ee</strong>dings of the 11th international conference onWorld Wide <strong>Web</strong>, pages 251–262, New York, NY, USA, 2002. ACM.57. S. Chakrabarti, K. Punera, <strong>and</strong> M. Subramanyam. Accelerated focused crawling throughonline relevance f<strong>ee</strong>dback. In the 11th Intl. World Wide <strong>Web</strong> Conf. (WWW02), pages148–159, 2002.58. G. Chang, M. Healey, J. McHugh, <strong>and</strong> T. Wang. <strong>Mining</strong> the World Wide <strong>Web</strong>: An InformationSearch Approach. Springer, 2001.59. O. Chapelle, B. Schölkopf, <strong>and</strong> A. Zien, editors. Semi-Supervised Learning. MIT Press,Cambridge, MA, 2006.60. W.-Y. Chen, D. Zhang, <strong>and</strong> E. Y. Chang. Combinational collaborative filtering for personalizedcommunity recommendation. In KDD ’08: Proc<strong>ee</strong>ding of the 14th ACMSIGKDD international conference on Knowledge discovery <strong>and</strong> data mining, pages115–123, New York, NY, USA, 2008. ACM.61. P.-A. Chirita, C. S. Firan, <strong>and</strong> W. Nejdl. Personalized query expansion for the web.In Proc<strong>ee</strong>dings of the 30th Annual International ACM SIGIR Conference on Research<strong>and</strong> Development in Information Retrieval (SIGIR’07), pages 7–14, Amsterdam, TheNetherl<strong>and</strong>s, 2007.62. P. A. Chirita, W. Nejdl, R. Paiu, <strong>and</strong> C. Kohlschütter. Using ODP metadata to personalizesearch. In Proc<strong>ee</strong>dings of the 28th Annual International ACM SIGIR Conference on Research<strong>and</strong> Development in Information Retrieval (SIGIR’05), pages 178–185, Salvador,Brazil, 2005.63. J. Cho <strong>and</strong> H. Garcia-Molina. The evolution of the web <strong>and</strong> implications for an incrementalcrawler. In Proc<strong>ee</strong>dings of the 26th International Conference on Very Large DataBases(VLDB’00), pages 200–209, 2000.64. D. A. Cohn <strong>and</strong> T. Hofmann. The missing link - a probabilistic model of documentcontent <strong>and</strong> hypertext connectivity. In NIPS, pages 430–436, 2000.
References 19965. R. Cooley, B. Mobasher, <strong>and</strong> J. Srivastava. Data preparation for mining world wide webbrowsing patterns. KNOWLEDGE AND INFORMATION SYSTEMS, 1:5–32, 1999.66. T. H. Cormen, C. E. Leiserson, R. L. Rivest, <strong>and</strong> C. Stein. Introduction to algorithms.McGraw-Hill, 2002.67. M. Craven, D. DiPasquo, D. Freitag, A. McCallum, T. Mitchell, K. Nigam, <strong>and</strong> S. Slattery.Learning to extract symbolic knowledge from the world wide web. In AAAI’98/IAAI ’98: Proc<strong>ee</strong>dings of the fift<strong>ee</strong>nth national/tenth conference on Artificial intelligence/Innovativeapplications of artificial intelligence, pages 509–516, Menlo Park,CA, USA, 1998. American Association for Artificial Intelligence.68. H. Cui, J.-R. Wen, J.-Y. Nie, <strong>and</strong> W.-Y. Ma. Query expansion by mining user logs. IEEETrans. Knowl. Data Eng., 15(4):829–839, 2003.69. B. Datta. Numerical Linear Algebra <strong>and</strong> Application. Brooks/Cole Publishing Company,1995.70. J. Dean <strong>and</strong> M. R. Henzinger. Finding related pages in the world wide web. ComputerNetworks, 31(11-16):1467–1479, 1999.71. S. D<strong>ee</strong>rwester, S. T. Dumais, G. W. Furnas, T. K. L<strong>and</strong>auer, <strong>and</strong> R. Harshman. Indexingby latent semantic analysis. Journal American Society for information retrieval,41(6):391–407, 1990.72. A. P. Dempster, N. M. Laird, <strong>and</strong> D. B. Rubin. Maximum likelihood from incompletedata via the em algorithm. JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIESB, 39(1):1–38, 1977.73. I. S. Dhillon. Co-clustering documents <strong>and</strong> words using bipartite spectral graph partitioning.In KDD ’01: Proc<strong>ee</strong>dings of the seventh ACM SIGKDD international conferenceon Knowledge discovery <strong>and</strong> data mining, pages 269–274, New York, NY, USA,2001. ACM.74. P. Diaconis <strong>and</strong> R. L. Graham. Spearman’s footrule as a measure of disarray. Journal ofthe Royal Statistical Society. Series B (Methodological), 39(2):262–268, 1977.75. L. Dietz, S. Bickel, <strong>and</strong> T. Scheffer. Unsupervised prediction of citation influences. InICML ’07: Proc<strong>ee</strong>dings of the 24th international conference on Machine learning, pages233–240, 2007.76. M. Diligenti, F. Coetz<strong>ee</strong>, S. Lawrence, C. L. Giles, <strong>and</strong> M. Gori. Focused crawling usingcontext graphs. In 26th Intl. Conf. on Very Large Databases (VLDB00), page 527?534,2000.77. C. Ding, X. He, P. Husb<strong>and</strong>s, H. Zha, <strong>and</strong> H. D. Simon. Pagerank, hits <strong>and</strong> a unifiedframework for link analysis. In Ding, Chris: Proc<strong>ee</strong>dings of the 25th annual internationalACM SIGIR conference on Research <strong>and</strong> development in information retrieval,pages 353–354, New York, NY, USA, 2002. ACM.78. G. Dong <strong>and</strong> J. Li. Efficient mining of emerging patterns: discovering trends <strong>and</strong> differences.In Proc<strong>ee</strong>dings of ACM SIGKDD International Conference on KnowledgeDiscovery <strong>and</strong> Data <strong>Mining</strong>, pages 43–52, 1999.79. Z. Dou, R. Song, <strong>and</strong> J.-R. Wen. A large-scale evaluation <strong>and</strong> analysis of personalizedsearch strategies. In Proc<strong>ee</strong>dings of the 16th International Conference on World Wide<strong>Web</strong> (WWW’07), pages 581–590, Banff, Alberta, Canada, 2007.80. Dou.Shen, Jian-Tao.Sun, Qiang.Yang, <strong>and</strong> Zheng.Chen. A comparison of implicit <strong>and</strong>explicit links for web page classification. In the 15th international conference on WorldWide <strong>Web</strong>(WWW’06), pages 643–650, 2006.81. M. Dunja. Personal web watcher: Design <strong>and</strong> implementation (report). Technical ReportIJS-DP-7472, Department of Intelligent Systems, J. Stefan Institute, Slovenia, 1996.
- Page 2 and 3:
Web Mining and Social Networking
- Page 4:
Guandong Xu • Yanchun Zhang • L
- Page 8 and 9:
VIIIPrefacefollowing characteristic
- Page 11:
Acknowledgements: We would like to
- Page 14 and 15:
XIVContents3.1.2 Basic Algorithms f
- Page 16 and 17:
XVIContentsPart III Social Networki
- Page 19:
Part IFoundation
- Page 22 and 23:
4 1 Introduction(3). Learning usefu
- Page 24 and 25:
6 1 Introductioncalled computationa
- Page 26 and 27:
8 1 Introduction• The data on the
- Page 28 and 29:
10 1 Introductionin a broad range t
- Page 31 and 32:
2Theoretical BackgroundsAs discusse
- Page 33 and 34:
2.2 Textual, Linkage and Usage Expr
- Page 35 and 36:
2.4 Eigenvector, Principal Eigenvec
- Page 37 and 38:
2.5 Singular Value Decomposition (S
- Page 39 and 40:
2.6 Tensor Expression and Decomposi
- Page 41 and 42:
2.7 Information Retrieval Performan
- Page 43 and 44:
2.8 Basic Concepts in Social Networ
- Page 45:
2.8 Basic Concepts in Social Networ
- Page 48 and 49:
30 3 Algorithms and TechniquesTable
- Page 50 and 51:
32 3 Algorithms and TechniquesSpeci
- Page 52 and 53:
34 3 Algorithms and Techniquesa sub
- Page 54 and 55:
36 3 Algorithms and TechniquesMetho
- Page 56 and 57:
38 3 Algorithms and TechniquesCusto
- Page 58 and 59:
40 3 Algorithms and TechniquesTable
- Page 60 and 61:
42 3 Algorithms and Techniquesa bSI
- Page 62 and 63:
44 3 Algorithms and Techniques{a}10
- Page 64 and 65:
46 3 Algorithms and Techniques3.2 S
- Page 66 and 67:
48 3 Algorithms and TechniquesConce
- Page 68 and 69:
50 3 Algorithms and TechniquesNaive
- Page 70 and 71:
52 3 Algorithms and Techniquesuses
- Page 72 and 73:
54 3 Algorithms and Techniquesin th
- Page 74 and 75:
56 3 Algorithms and Techniques// Fu
- Page 76 and 77:
58 3 Algorithms and Techniquesendd
- Page 78 and 79:
60 3 Algorithms and Techniquesstart
- Page 80 and 81:
62 3 Algorithms and TechniquesHere
- Page 82 and 83:
64 3 Algorithms and Techniques3.8.2
- Page 84 and 85:
66 3 Algorithms and Techniquesfor e
- Page 86 and 87:
68 3 Algorithms and Techniquesthat
- Page 89 and 90:
4Web Content MiningIn recent years
- Page 91 and 92:
score(q,d)=4.2 Web Search 73V(q) ·
- Page 93 and 94:
4.2 Web Search 75algorithm. The Web
- Page 95 and 96:
4.3 Feature Enrichment of Short Tex
- Page 97 and 98:
4.4 Latent Semantic Indexing 794.4
- Page 99 and 100:
Notation4.5 Automatic Topic Extract
- Page 101 and 102:
4.5 Automatic Topic Extraction from
- Page 103 and 104:
4.6 Opinion Search and Opinion Spam
- Page 105:
4.6 Opinion Search and Opinion Spam
- Page 108 and 109:
90 5 Web Linkage Mining5.2 Co-citat
- Page 110 and 111:
92 5 Web Linkage Mining{ /1 out deg
- Page 112 and 113:
94 5 Web Linkage Mininga =(a(1),·
- Page 114 and 115:
96 5 Web Linkage Mining5.4.1 Bipart
- Page 116 and 117:
98 5 Web Linkage MiningNext, consid
- Page 118 and 119:
100 5 Web Linkage Mining(5) Creatin
- Page 120 and 121:
102 5 Web Linkage Miningpower-law d
- Page 122 and 123:
104 5 Web Linkage MiningFig. 5.10.
- Page 124 and 125:
106 5 Web Linkage Miningbetween use
- Page 126 and 127:
6Web Usage MiningIn previous chapte
- Page 129 and 130:
6.1 Modeling Web User Interests usi
- Page 131 and 132:
6.1 Modeling Web User Interests usi
- Page 133 and 134:
6.1 Modeling Web User Interests usi
- Page 135 and 136:
6.1 Modeling Web User Interests usi
- Page 137 and 138:
6.2 Web Usage Mining using Probabil
- Page 139 and 140:
6.2 Web Usage Mining using Probabil
- Page 141 and 142:
6.2 Web Usage Mining using Probabil
- Page 143 and 144:
6.3 Finding User Access Pattern via
- Page 145 and 146:
6.3 Finding User Access Pattern via
- Page 147 and 148:
6.3 Finding User Access Pattern via
- Page 149 and 150:
6.4 Co-Clustering Analysis of weblo
- Page 151 and 152:
6.5 Web Usage Mining Applications 1
- Page 153 and 154:
6.5 Web Usage Mining Applications 1
- Page 155 and 156:
6.5 Web Usage Mining Applications 1
- Page 157 and 158:
6.5 Web Usage Mining Applications 1
- Page 159 and 160:
6.5 Web Usage Mining Applications 1
- Page 161:
Part IIISocial Networking and Web R
- Page 164 and 165:
146 7 Extracting and Analyzing Web
- Page 166 and 167: 148 7 Extracting and Analyzing Web
- Page 168 and 169: 150 7 Extracting and Analyzing Web
- Page 170 and 171: 152 7 Extracting and Analyzing Web
- Page 172 and 173: 154 7 Extracting and Analyzing Web
- Page 174 and 175: 156 7 Extracting and Analyzing Web
- Page 176 and 177: 158 7 Extracting and Analyzing Web
- Page 178 and 179: 160 7 Extracting and Analyzing Web
- Page 180 and 181: 162 7 Extracting and Analyzing Web
- Page 182 and 183: 164 7 Extracting and Analyzing Web
- Page 184 and 185: 166 7 Extracting and Analyzing Web
- Page 186 and 187: 168 7 Extracting and Analyzing Web
- Page 188 and 189: 170 8 Web Mining and Recommendation
- Page 190 and 191: 172 8 Web Mining and Recommendation
- Page 192 and 193: 174 8 Web Mining and Recommendation
- Page 194 and 195: 176 8 Web Mining and Recommendation
- Page 196 and 197: 178 8 Web Mining and Recommendation
- Page 198 and 199: 180 8 Web Mining and Recommendation
- Page 200 and 201: 182 8 Web Mining and Recommendation
- Page 202 and 203: 184 8 Web Mining and Recommendation
- Page 204 and 205: 186 8 Web Mining and Recommendation
- Page 206 and 207: 188 8 Web Mining and Recommendation
- Page 208 and 209: 190 9 Conclusionsries commonly used
- Page 210 and 211: 192 9 Conclusionsas computer scienc
- Page 212 and 213: 194 9 Conclusionsresearches have de
- Page 214 and 215: 196 References14. J. Ayres, J. Gehr
- Page 218 and 219: 200 References82. C. Dwork, R. Kuma
- Page 220 and 221: 202 References119. J. Hou and Y. Zh
- Page 222 and 223: 204 References151. A. N. Langville
- Page 224 and 225: 206 References186. J. K. Mui and K.
- Page 226 and 227: 208 References223. C. Shahabi, A. M
- Page 228: 210 References260. G.-R. Xue, D. Sh