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

196 References14. J. Ayres, J. Gehrke, T. Yiu, and J. Flannick. Sequential pattern mining using a bitmaprepresentation. In Proceedings of ACM SIGKDD International Conference on KnowledgeDiscovery and Data Mining, pages 429–435, 2002.15. B. W. Bader, R. A. Harshman, and T. G. Kolda. Temporal analysis of semantic graphsusing asalsan. In ICDM ’07: Proceedings of the 2007 Seventh IEEE International Conferenceon Data Mining, pages 33–42, Washington, DC, USA, 2007. IEEE ComputerSociety.16. R. A. Baeza-Yates, C. A. Hurtado, and M. Mendoza. Improving search engines by queryclustering. JASIST, 58(12):1793–1804, 2007.17. R. A. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-WesleyLongman Publishing Co., Inc., Boston, MA, USA, 1999.18. T. L. Bailey and C. Elkan. Fitting a mixture model by expectation maximization to discovermotifs in biopolymers. In Proceedings of International Conference on IntelligentSystems for Molecular Biology, pages 28–36, 1994.19. M. F. Balcan, A. Blum, P. P. Choi, J. Lafferty, B. Pantano, M. R. Rwebangira, and X. Zhu.Person identification in webcam images: An application of semi-supervised learning. InICML 2005 Workshop on Learning with Partially Classified Training Data, 2005.20. P. Baldi, P. Frasconi, , and P. Smyth. Modeling the internet and the web: probabilisticmethods and algorithms. John Wiley & Sons, 2003.21. E. Balfe and B. Smyth. An analysis of query similarity in collaborative web search.In Advances in Information Retrieval, 27th European Conference on IR Research,(ECIR’05), pages 330–344, Santiago de Compostela, Spain, 2005.22. A. Barabsi and R. Albert. Emergence of scaling in random networks. Science,286(5439):509512, 1999.23. J. Barnes. Social Networks Reading. MA: Addison-Wesley, 1972.24. R. J. Bayardo. Efficiently mining long patterns from databases. In Proceedings of theACM SIGMOD International Conference on Management of Data, pages 85–93, 1998.25. D. Beeferman and A. L. Berger. Agglomerative clustering of a search engine querylog. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledgediscovery and data mining (KDD’00), pages 407–416, Boston, MA, USA, 2000.26. M. Belkin and P. Niyogi. Semi-supervised learning on riemannian manifolds. MachineLearning, 1-3(56):209–239, 2004.27. M. Belkin, P. Niyogi, and V. Sindhwani. Manifold regularization: A geometric frameworkfor learning from labeled and unlabeled examples. Journal of Machine LearningResearch, 7:2399–2434, 2006.28. D. Bergmark, C. Lagoze, and A. Sbityakov. Focused crawls, tunneling, and digital libraries.In ECDL ’02: Proceedings of the 6th European Conference on Research andAdvanced Technology for Digital Libraries, pages 91–106, London, UK, 2002. Springer-Verlag.29. P. Berkhin. Survey of clustering data mining techniques. Technical report, AccrueSoftware, Inc., 2002.30. K. Bharat, A. Broder, M. Henzinger, P. Kumar, and S. Venkatasubramanian. The connectivityserver: fast access to linkage information on the web. Comput. Netw. ISDNSyst., 30(1-7):469–477, 1998.31. K. Bharat and M. R. Henzinger. Improved algorithms for topic distillation in a hyperlinkedenvironment. In SIGIR ’98: Proceedings of the 21st annual international ACMSIGIR conference on Research and development in information retrieval, pages 104–111, New York, NY, USA, 1998. ACM.