202 References119. J. Hou <strong>and</strong> Y. Zhang. Constructing good quality web page communities. In ADC ’02:Proc<strong>ee</strong>dings of the 13th Australasian database conference, pages 65–74, Darlinghurst,Australia, Australia, 2002. Australian Computer Society, Inc.120. J. Hou <strong>and</strong> Y. Zhang. Effectively finding relevant web pages from linkage information.IEEE Trans. on Knowl. <strong>and</strong> Data Eng., 15(4):940–951, 2003.121. J. Hou <strong>and</strong> Y. Zhang. Utilizing hyperlink transitivity to improve web page clustering.In Proc<strong>ee</strong>dings of the 14th Australasian Database Conferences (ADC2003), volume 37,pages 49–57, Adelaide, Australia, 2003. ACS Inc.122. A. K. Jain, M. N. Murty, <strong>and</strong> P. J. Flynn. Data clustering: a review. ACM Comput. Surv.,31(3):264–323, 1999.123. K. Järvelin <strong>and</strong> J. Kekäläinen. Cumulated gain-based evaluation of ir techniques. ACMTrans. Inf. Syst., 20(4):422–446, 2002.124. G. Jeh <strong>and</strong> J. Widom. Scaling personalized web search. In Proc<strong>ee</strong>dings of the 12th InternationalWorld Wide <strong>Web</strong> Conference (WWW’03), pages 271–279, Budapest, Hungary,2003.125. F. Jelinek. Statistical methods for sp<strong>ee</strong>ch recognition. MIT Press, 1997.126. X. Jin <strong>and</strong> B. Mobasher. Using semantic similarity to enhance item-based collaborativefiltering. In in Proc<strong>ee</strong>dings of The 2nd International Conference on Information <strong>and</strong>Knowledge Sharing, 2003.127. X. Jin, Y. Zhou, <strong>and</strong> B. Mobasher. A unified approach to personalization based onprobabilistic latent semantic models of web usage <strong>and</strong> content. In Proc<strong>ee</strong>dings of theAAAI 2004 Workshop on Semantic <strong>Web</strong> Personalization (SWP’04), San Jose, 2004.128. X. Jin, Y. Zhou, <strong>and</strong> B. Mobasher. A maximum entropy web recommendation system:Combining collaborative <strong>and</strong> content features. In Proc<strong>ee</strong>dings of the ACM SIGKDDConference on Knowledge Discovery <strong>and</strong> Data <strong>Mining</strong> (KDD’05), pages 612–617,Chicago, 2005.129. T. Joachims, D. Freitag, <strong>and</strong> T. Mitchell. <strong>Web</strong>watcher: A tour guide for the world wideweb. In The 15th International Joint Conference on Artificial Intelligence (IJCAI’97),pages 770–777, Nagoya, Japan, 1997.130. M. I. Jordan, editor. Learning in graphical models. MIT Press, Cambridge, MA, USA,1999.131. N. Kaji <strong>and</strong> M. Kitsuregawa. Building lexicon for sentiment analysis from massive collectionof html documents. In Proc<strong>ee</strong>dings of the 2007 Joint Conference on EmpiricalMethods in Natural Language Processing <strong>and</strong> Computational Natural Language Learning(EMNLP-CoNLL’07), pages 1075–1083, 2007.132. M. Kamber, J. Han, <strong>and</strong> J. Chiang. Metarule-guided mining of multi-dimensional associationrules using data cubes. In Proc<strong>ee</strong>dings of ACM SIGKDD International Conferenceon Knowledge Discovery <strong>and</strong> Data <strong>Mining</strong>, pages 207–210, 1997.133. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, <strong>and</strong> G. H. Golub. Extrapolation methodsfor accelerating pagerank computations. In WWW ’03: Proc<strong>ee</strong>dings of the 12thinternational conference on World Wide <strong>Web</strong>, pages 261–270, New York, NY, USA,2003. ACM.134. H. R. Kim <strong>and</strong> P. K. Chan. Learning implicit user interest hierarchy for context inpersonalization. In Proc<strong>ee</strong>dings of the 2003 International Conference on IntelligentUser Interfaces (IUI’03), pages 101–108, Miami, FL, USA, 2003.135. H.-r. Kim <strong>and</strong> P. K. Chan. Personalized ranking of search results with learned userinterest hierarchies from bookmarks. In Proc<strong>ee</strong>dings of the 7th WEBKDD workshopon Knowledge Discovery from the <strong>Web</strong> (WEBKDD’05), pages 32–43, Chicago, Illinois,USA, 2005.
References 203136. M. Kitsuregawa, T. Tamura, M. Toyoda, <strong>and</strong> N. Kaji. Socio-sense: a system for analysingthe societal behavior from long term web archive. In Proc<strong>ee</strong>dings of the 10th Asia-Pacificweb conference on Progress in WWW research <strong>and</strong> development(AP<strong>Web</strong>’08), pages 1–8,2008.137. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. In Proc. of theNinth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’98), pages 668–677, 1998.138. M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, <strong>and</strong> A. I. Verkamo. Findinginteresting rules from large sets of discovered association rules. In Proc<strong>ee</strong>dings of ACMConference on Information <strong>and</strong> Knowledge Management, pages 401–407, 1994.139. J. Konstan, B. Miller, D. Maltz, J. Herlocker, L. Gordon, <strong>and</strong> J. Riedl. Grouplens: Applyingcollaborative filtering to usenet news. Communications of the ACM, 40:77–87,1997.140. R. Kosala <strong>and</strong> H. Block<strong>ee</strong>l. <strong>Web</strong> mining research: a survey. SIGKDD Explor. Newsl.,2(1):1–15, 2000.141. A. Krogh, M. Brown, I. Mian, K. Sjol<strong>and</strong>er, <strong>and</strong> D. Haussler. Hidden markov modelsin computational biology. applications to protein modeling. Journal of ComputationalBiology, 235:1501–1531, 1994.142. D. Kulp, D. Haussler, M. G. R<strong>ee</strong>se, <strong>and</strong> F. H. Eeckman. A generalized hidden markovmodel for the recognition of human genes in dna. In Proc<strong>ee</strong>dings of the Fourth InternationalConference on Intelligent Systems for Molecular Biology, pages 134–142. AAAIPress, 1996.143. H. C. Kum, J. Pei, W. Wang, <strong>and</strong> D. Duncan. Approxmap: Approximate mining ofconsensus sequential patterns. In Proc<strong>ee</strong>dings of SIAM International Conference onData <strong>Mining</strong>, pages 311–315, 2003.144. R. Kumar, J. Novak, <strong>and</strong> A. Tomkins. Structure <strong>and</strong> evolution of online social networks.In KDD ’06: Proc<strong>ee</strong>dings of the 12th ACM SIGKDD international conferenceon Knowledge discovery <strong>and</strong> data mining, pages 611–617, New York, NY, USA, 2006.ACM.145. R. Kumar, P. Raghavan, S. Rajagopalan, <strong>and</strong> A. Tomkins. Extracting large-scale knowledgebases from the web. In VLDB ’99: Proc<strong>ee</strong>dings of the 25th International Conferenceon Very Large Data Bases, pages 639–650, San Francisco, CA, USA, 1999. MorganKaufmann Publishers Inc.146. R. Kumar, P. Raghavan, S. Rajagopalan, <strong>and</strong> A. Tomkins. Trawling the web for emergingcyber-communities. In WWW ’99: Proc<strong>ee</strong>dings of the eighth international conference onWorld Wide <strong>Web</strong>, pages 1481–1493, New York, NY, USA, 1999. Elsevier North-Holl<strong>and</strong>,Inc.147. K. Kummamuru, R. Lotlikar, S. Roy, K. Singal, <strong>and</strong> R. Krishnapuram. A hierarchicalmonothetic document clustering algorithm for summarization <strong>and</strong> browsing search results.In WWW ’04: Proc<strong>ee</strong>dings of the 13th international conference on World Wide<strong>Web</strong>, pages 658–665, New York, NY, USA, 2004. ACM.148. W. Lam, S. Mukhopadhyay, J. Mostafa, <strong>and</strong> M. J. Palakal. Detection of shifts in userinterests for personalized information filtering. In Proc<strong>ee</strong>dings of the 19th Annual InternationalACM SIGIR Conference on Research <strong>and</strong> Development in Information Retrieval(SIGIR’96), pages 317 – 325, Zurich, Switzerl<strong>and</strong>, 1996.149. K. Lang. Newsw<strong>ee</strong>der: Learning to filter netnews. In in Proc<strong>ee</strong>dings of the 12th InternationalMachine Learning Conference (ML95, 1995.150. A. N. Langville <strong>and</strong> C. D. Meyer. D<strong>ee</strong>per inside pagerank. Internet Mathematics,1(3):335380, 2005.
- 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 218 and 219: 200 References82. C. Dwork, R. Kuma
- 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