|
[1] Abello, J., Pardalos, P. M., and Resende, M. G.(1998), On Maximum Clique Problems in Very Large Graphs, Research Technical Report, AT&T Labs, TR 98.32.1. [2] Adamic, L. A., and Huberman, B. A.(2000), Power-Law Distribution of the World Wide Web, Science, 287(5461), pp.2115a. [3] Adomavicius, G.., and Tuzhilin, T.(2003), Recommendation Technologies: Survey of Current Methods and Possible Extensions, Working Paper, University of Minnesota. [4] Agrawal, R. and Srikant, R.(1994), Fast algorithms for mining association rules, Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, pp.478-499. [5] Albert, R., Jeong, H., and Barabasi, A. L.(1999), Diameter of the World-Wide Web, Nature, 401, pp.130-131. [6] Amaral, L. A. N., Scala, A., Barthelemy, M., and Stanley, H. E.(2000), Classes of Small-World Networks, Proceedings of the National Academy of Sciences, 97, pp.11149-11152. [7] Balabanovic, M., and Shoham, Y.(1997), Fab: Content-based, Collaborative Recommendation, Communications of the ACM, 40(3), pp.66-72. [8] Barabasi, A. L., and Albert, R.(1999), Emergence of Scaling in Random Networks, Science, 286, pp.509-512. [9] Billsus, D., and Pazzani, M.(1998), Learning Collaborative Information Filters, Proceedings of the International Conference on Machine Learning, Morgan Kaufmann Press, pp. 46-53. [10] Chang, C. L., Chen, D. Y. and Chuang, T. R.(2002), Browsing Newsgroups with A Social Network Analyzer, Proceedings of the 6th International Conference on Information Visualisation, London, UK, pp. 750-755. [11] Chen, M. S., Han, J. and Yu, P. S.(1996), Data Mining: An Overview from a Database Perspective, IEEE Transaction on Knowledge and Data Engineering, 8(6), pp.866-883. [12] Claypool, M., Gokhale, A., Miranda, T., Murnikov, P. Netes, D., and Sartin, M.(1999), Combining Content-Based and Collaborative Filters in An Online Newspaper, Proceedings of the ACM SIGIR’99. Workshop on Recommender Systems: Algorithms and Evaluation, University of California, Berkeley.
[13] Cook, D. J., and Holder, L. B.(2000), Graph-Based Data Mining, IEEE Intelligent System, 15(2), pp.32-41. [14] Cook, D. J., Holder, L. B., and Djoko, S.(1996), Scalable Discovery of Informative Structural Concepts Using Domain Knowledge, IEEE Expert, 11(5), pp59-68. [15] Cormen, T., Leiserson, C., and Rivest, R.(1990), Introduction to algorithms, Cambridge, The MIT Press. [16] Djoko, S., Cook, D. J., and Holder, L. B.(1997), An Empirical Study of Domain Knowledge and Its Benefits to Substructure Discovery, IEEE Transactions on Knowledge and Data Engineering, 9(4), pp.575-586. [17] Garton, L., Haythornthwaite, C., and Wellman, B. (1997), Studying Online Social Networks, Journal of Computer Mediated Communication, 3(1), pp.75-105. [18] Guare, J., Six Degrees of Separation: A Play, New York, Weekly. [19] Hayes, L.(1994), Using computers to divine who might buy a gas grill, The Wall Street Journal, August 16, pp. B1-B4. [20] Hill, W., Stead, L., Rosenstein, M., and Furnas, G.. (1995), Recommending and Evaluating Choices in a Virtual Community of Use, Proceedings of ACM SIGCHI’95 Conference on Human Factors in Computing Systems, Denver, United States, pp.194-201. [21] Konstan, J. A., Miller, B. N., Maltz, D., Herlocker, J. L., Gordon, L. R., and Riedl, J.(1997), GroupLens: Applying Collaborative Filtering to Usenet News, Communications of the ACM, 40(3), pp.77-87. [22]Kramer, J., Noronha, S., and Vergo, J.(2000), A User-Centered Design Approach to Personalization, Communication of the ACM, 43(3), pp.44-48. [23] Kumar, R., Raghavan, P., Rajagopalan, S., and Tomkins, A.(1999), Trawling the Web for Emerging Cyber-Communities, Computer Networks, 31(11-16), pp.1481-1493. [24]Kotler, P.(1991), Marketing Management-Analysis Planning, Implementation, and Control, 7th ed, Englewood Cliffs:Prentice-Hall Inc. [25] Lang, L.(1995), NewsWeeder: Learning to Filter Netnews, Proceedings of 12th International Conference on Machine Learining, California, United States, pp. 331-339. [26] Lin, F. R., and Chen, C. H.(2004), Developing and Evaluating the Social Network Analysis System for Virtual Teams in Cyber Communities, Proceedings of the 37th Aunual Hawaii International Conference on System Sciences, Hawaii, United States, January 6-9. [27]Langheinrich, M., Nakamura, A., Abe, N., Kamba, T., and Koseki, Y.(1999), Unintrusive customization techniques for Web advertising, Computer Networks, 31, pp.1259-1272. [28] Melville, P., Mooney, R. J., and Nagarajan, R.(2002), Content-Boosted Collaborative Filtering for Improved Recommendations, Proceedings of the Eighteenth National Conference on Artificial Intelligence, Edmonton, Canada, pp.187-192. [29] Milgram, S.(1967), The Small World Problem, Psychology Today, 22, pp.60-67. [30] Mitra, S. K. Pal, P. Mitra, “Data Mining in Soft Computing Framework: A Survey.” IEEE Transaction on Neural Networks, 13(1), pp.3-14. [31] Mooney, R. J.(2000), Content-Based Book Recommending Using Learning for Text Categorization, Proceedings of the Fifth ACM Conference on Digital Libraries, San Antonio, United States, pp.195-204. [32]Manber, U., Patel, A., and Robison, J.(2000), Experience with Personalization on YAHOO!, Communications of the ACM, 43(8), pp.35-39. [33] Newman, M. E. J.(2001), The Structure of Scientific Collaboration Networks, Proceedings of the National Academy of Sciences, USA 98, pp.409-415. [34] Newman, M., Watts, D. and Strogatz, S.(2001), Random Graph Models of Social Networks, Proceedings of the National Academy of Sciences of the United States of America, 99(1), pp.2566-2572. [35] Pazzani, M., and Billsus, D.(1997), Learning and Revising User Profiles: The Identification of Interesting Web Sites, Machine Learning, 27, pp313-331. [36] Preece, J.(2002), Online Communities: Designing Usability and supporting sociability, UK, John Wiley & Sons. [37] Resnick, P., Iakovou, N., Sushak, M., Bergstrom, P. and Riedl, J.(1994), GroupLens: An Open Architecture for Collaborative Filtering of Netnews, Proceedings of ACM CSCW’94 Conference on Computer-Supported Cooperative Work, New York, United States, pp.175-186. [38] Salton, G.(1989), Automatic Text Processing, Boston, United States. [39] Savasere, A., Omiecinski, E. and Navathe, S.(1995), An Efficient Algorithm for Mining Association Rules in Large Database, Proceedings of the 21th International Conference on Very Large Database, pp.432-444. [40] Schwartz, M. and Wood, D.(1993), Discovering Shared Interests Using Graph Analysis, Communication of the ACM, 36(8), pp.78-89. [41] Shardanand, U. and Maes, P.(1995), Social Information Filtering: Algorithms for Automating “Word of Mouth”, Proceedings of the Conference on Human Factors in Computing Systems, New York, United States, pp.210-217. [42] Soo, J., Chen, M. S. and Yu, P. S.(1997), Using a Hash-Based Method with Transaction Trimming and Database Scan Reduction for Mining Association Rules, IEEE Transaction on Knowledge and Data Engineering, 9(5), pp.813-825. [43]Schafer, J. B., Konstan, J. A., and Riedl, J.(2001), E-Commerce Recommendation Applications, Data Mining and Knowledge Discovery, 5(1), pp.115-153. [44] Ungar, L. H., and Foster, D. P.(1998), Clustering Methods for Collaborative Filtering, In Proceedings of the Workshop. on Recommendation System. Papers from 1998 Workshop. Technical Report WS-98-08, AAAI Press. [45] Wasserman, S. and Faust, K.(1994), Social Network Analysis: Methods and Applications, New York, Cambridge University Press, pp.69-166. [46] Watts, D. J. and Strogatz, S. H.(1998), Collective Dynamics of ‘Small World’ Networks, NATURE, 393, pp.440-442.
|