Web Mining and Social Networking: Techniques and ... - tud.ttu.ee

References 201hypermedia : links, objects, time and space—structure in hypermedia systems, pages225–234, New York, NY, USA, 1998. ACM.100. N. S. Glance. Community search assistant. In Proceedings 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. andDavid M. Pennock, and G. W. Flake. Usingweb structure for classifying and describing web pages. In the Eleventh InternationalWorld Wide Web Conference (WWW’02), pages 562–569, 2002.102. B. Goethals. Survey on frequent pattern mining. Technical report, 2002.103. G. H. Golub and C. F. V. Loan. Matrix computations. The Johns Hopkins UniversityPress, 1983.104. A. Gruber, M. Rosen-Zvi, and Y. Weiss. Latent topic models for hypertext. In Uncertaintyin Artificial Intelligence (UAI), pages 230–240, 2008.105. J. Han, G. Dong, and Y. Yin. Efficient mining of partial periodic patterns in time seriesdatabase. In Proceedings of International Conference on Data Engineering, pages 106–115, 1999.106. J. Han and M. Kambe. Data Mining: Concepts and Techniques. Morgan KaufmannPublishers, 2000.107. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. InProceedings of the 2000 ACM SIGMOD international conference on Management ofdata, pages 1–12, 2000.108. D. Hanisch, A. Zien, R. Zimmer, and T. Lengauer. Co-clustering of biological networksand 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 Meeting of the Psychometric Society and the Society forMathematical Psychology, McMaster University, Hamilton, Ontario, 1978.110. J. A. Hartigan and 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, and J. Friedman. The elements of statistical learning: datamining, inference and prediction. Springer, 2 edition, 2008.112. T. H. Haveliwala. Topic-sensitive pagerank. In WWW ’02: Proceedings of the 11thinternational conference on World Wide Web, 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, and P. Indyk. Scalable techniques for clustering the web(extended abstract). In WebDB2000, Third International Workshop on the Web andDatabases, In conjunction with ACM SIGMOD2000, 2000.115. M. Hein and M. Maier. Manifold denoising. In Advances in Neural Information ProcessingSystems 19, 2006.116. J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl. An algorithmic framework forperforming collaborative filtering. In SIGIR ’99: Proceedings of the 22nd annual internationalACM SIGIR conference on Research and development in information retrieval,pages 230–237, New York, NY, USA, 1999. ACM.117. J. L. Herlocker, J. A. Konstan, L. G. Terveen, and 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.