200 References82. C. Dwork, R. Kumar, M. Naor, <strong>and</strong> D. Sivakumar. Rank aggregation methods forthe web. In Proc<strong>ee</strong>dings of the 10th International Conference on World Wide <strong>Web</strong>(WWW’01), pages 613–622, Hong Kong, China, 2001.83. J. M. E. B. Hunt <strong>and</strong> P. Stone. Experiments in induction. Academic Press, 1966.84. R. J. Elliott, J. B. Moore, <strong>and</strong> L. Aggoun. Hidden Markov Models. Estimation <strong>and</strong>Control. New York: Springer-Verlag, 1995.85. E. Erosheva, S. Fienberg, <strong>and</strong> J. Lafferty. Mixed membership models of scientific publications.In Proc<strong>ee</strong>dings of the National Academy of Sciences, volume 101, pages 5220–5227, 2004.86. E. Eskin <strong>and</strong> P. Pevzner. Finding composite regulatory patterns in dna sequences. InProc<strong>ee</strong>dings of International Conference on Intelligent Systems for Molecular Biology,pages 354–363, 2002.87. M. Ester, H.-P. Kriegel, J. S<strong>and</strong>er, M. Wimmer, <strong>and</strong> X. Xu. Incremental clustering formining in a data warehousing environment. In Proc<strong>ee</strong>dings of the 24rd InternationalConference on Very Large Data Bases(VLDB’98), pages 323–333, 1998.88. M. Ester, H.-P. Kriegel, J. S<strong>and</strong>er, <strong>and</strong> X. Xu. A density-based algorithm for discoveringclusters in large spatial databases with noise. In Proc. of 2nd International Conferenceon Knowledge Discovery <strong>and</strong>, pages 226–231, 1996.89. M. Ester, H. peter Kriegel, J. S, <strong>and</strong> X. Xu. A density-based algorithm for discoveringclusters in large spatial databases with noise. In SIGKDD, pages 226–231, 1996.90. A. Farahat, T. LoFaro, J. C. Miller, G. Rae, <strong>and</strong> L. A. Ward. Authority rankings fromhits, pagerank, <strong>and</strong> salsa: Existence, uniqueness, <strong>and</strong> effect of initialization. SIAM J. Sci.Comput., 27(4):1181–1201, 2006.91. U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, <strong>and</strong> R. Uthurusamy. Advances in KnowledgeDiscovery <strong>and</strong> Data <strong>Mining</strong>. AAAI/MIT Press, 1996.92. P. Ferragina <strong>and</strong> A. Gulli. A personalized search engine based on web-snippet hierarchicalclustering. In WWW ’05: Special interest tracks <strong>and</strong> posters of the 14th internationalconference on World Wide <strong>Web</strong>, pages 801–810, New York, NY, USA, 2005. ACM.93. G. W. Flake, S. Lawrence, <strong>and</strong> C. L. Giles. Efficient identification of web communities.In KDD ’00: Proc<strong>ee</strong>dings of the sixth ACM SIGKDD international conferenceon Knowledge discovery <strong>and</strong> data mining, pages 150–160, New York, NY, USA, 2000.ACM.94. J. Fürnkranz. Exploiting structural information for text classification on the www. Inthe Third International Symposium on Advances in Intelligent Data Analysis(IDA’99),pages 487–498, 1999.95. M. N. Garofalakis, R. Rastogi, <strong>and</strong> K. Shim. Spirit: Sequential pattern mining with regularexpression constraints. In Proc<strong>ee</strong>dings of International Conference on Very LargeData Bases, pages 223–234, 1999.96. S. Geman <strong>and</strong> D. Geman. Stochastic relaxation, Gibbs distributions, <strong>and</strong> the Bayesianrestoration of images. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA,1990.97. R. Ghani <strong>and</strong> A. Fano. Building recommender systems using a knowledge base of productsemantics. In in Proc<strong>ee</strong>dings of the Workshop on Recommendation <strong>and</strong> Personalizationin E-Commerce, at the 2nd International Conference on Adaptive Hypermedia <strong>and</strong>Adaptive <strong>Web</strong> Based Systems, 2002.98. E. Giannakidou, V. A. Koutsonikola, A. Vakali, <strong>and</strong> Y. Kompatsiaris. Co-clustering tags<strong>and</strong> social data sources. In WAIM, pages 317–324, 2008.99. D. Gibson, J. Kleinberg, <strong>and</strong> P. Raghavan. Inferring web communities from link topology.In HYPERTEXT ’98: Proc<strong>ee</strong>dings of the ninth ACM conference on Hypertext <strong>and</strong>
References 201hypermedia : links, objects, time <strong>and</strong> space—structure in hypermedia systems, pages225–234, New York, NY, USA, 1998. ACM.100. N. S. Glance. Community search assistant. In Proc<strong>ee</strong>dings of the 2001 InternationalConference on Intelligent User Interfaces (IUI’01), pages 91–96, Santa Fe, NM, USA,2001.101. E. J. Glover, K. Tsioutsiouliklis, S. L. <strong>and</strong>David M. Pennock, <strong>and</strong> G. W. Flake. Usingweb structure for classifying <strong>and</strong> describing web pages. In the Eleventh InternationalWorld Wide <strong>Web</strong> Conference (WWW’02), pages 562–569, 2002.102. B. Goethals. Survey on frequent pattern mining. Technical report, 2002.103. G. H. Golub <strong>and</strong> C. F. V. Loan. Matrix computations. The Johns Hopkins UniversityPress, 1983.104. A. Gruber, M. Rosen-Zvi, <strong>and</strong> Y. Weiss. Latent topic models for hypertext. In Uncertaintyin Artificial Intelligence (UAI), pages 230–240, 2008.105. J. Han, G. Dong, <strong>and</strong> Y. Yin. Efficient mining of partial periodic patterns in time seriesdatabase. In Proc<strong>ee</strong>dings of International Conference on Data Engin<strong>ee</strong>ring, pages 106–115, 1999.106. J. Han <strong>and</strong> M. Kambe. Data <strong>Mining</strong>: Concepts <strong>and</strong> <strong>Techniques</strong>. Morgan KaufmannPublishers, 2000.107. J. Han, J. Pei, <strong>and</strong> Y. Yin. <strong>Mining</strong> frequent patterns without c<strong>and</strong>idate generation. InProc<strong>ee</strong>dings of the 2000 ACM SIGMOD international conference on Management ofdata, pages 1–12, 2000.108. D. Hanisch, A. Zien, R. Zimmer, <strong>and</strong> T. Lengauer. Co-clustering of biological networks<strong>and</strong> gene expression data. In ISMB, pages 145–154, 2002.109. R. A. Harshman. Models for analysis of asymmetrical relationships among n objectsor stimuli. In In First Joint M<strong>ee</strong>ting of the Psychometric Society <strong>and</strong> the Society forMathematical Psychology, McMaster University, Hamilton, Ontario, 1978.110. J. A. Hartigan <strong>and</strong> M. A. Wong. Algorithm as 136: A k-means clustering algorithm.Royal Statistical Society, Series C (Applied Statistics), 1(28):100–108, 1979.111. T. Hastie, R. Tibshirani, <strong>and</strong> J. Friedman. The elements of statistical learning: datamining, inference <strong>and</strong> prediction. Springer, 2 edition, 2008.112. T. H. Haveliwala. Topic-sensitive pagerank. In WWW ’02: Proc<strong>ee</strong>dings of the 11thinternational conference on World Wide <strong>Web</strong>, pages 517–526, New York, NY, USA,2002. ACM.113. T. H. Haveliwala. Topic-sensitive pagerank: A context-sensitive ranking algorithm forweb search. IEEE Trans. Knowl. Data Eng., 15(4):784–796, 2003.114. T. H. Haveliwala, A. Gionis, <strong>and</strong> P. Indyk. Scalable techniques for clustering the web(extended abstract). In <strong>Web</strong>DB2000, Third International Workshop on the <strong>Web</strong> <strong>and</strong>Databases, In conjunction with ACM SIGMOD2000, 2000.115. M. Hein <strong>and</strong> M. Maier. Manifold denoising. In Advances in Neural Information ProcessingSystems 19, 2006.116. J. L. Herlocker, J. A. Konstan, A. Borchers, <strong>and</strong> J. Riedl. An algorithmic framework forperforming collaborative filtering. In SIGIR ’99: Proc<strong>ee</strong>dings of the 22nd annual internationalACM SIGIR conference on Research <strong>and</strong> development in information retrieval,pages 230–237, New York, NY, USA, 1999. ACM.117. J. L. Herlocker, J. A. Konstan, L. G. Terv<strong>ee</strong>n, <strong>and</strong> J. T. Riedl. Evaluating collaborativefiltering recommender systems. ACM Transaction on Information Systems (TOIS),22(1):5 – 53, 2004.118. T. Hofmann. Probabilistic latent semantic analysis. In In Proc. of Uncertainty in ArtificialIntelligence, UAI99, pages 289–296, 1999.
- 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 216 and 217: 198 References49. D. Chakrabarti, R
- 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