A graph based approach to extract a neighborhood customer community for collaborative filtering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2544, Issue , 2002, Pages 188-200

  Reddy, P Krishna ^a   Kitsuregawa, Masaru ^b   Sreekanth, P ^a   Srinivasa Rao, S ^a  

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

^b INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

Cross sell; Customer loyalty; Electronic commerce; Interface; Masscustomization; Recommender systems; Up sell

Indexed keywords

ELECTRONIC COMMERCE; GRAPHIC METHODS; INFORMATION SYSTEMS; INFORMATION USE; INTERFACES (MATERIALS); RECOMMENDER SYSTEMS; SALES;

BIPARTITE GRAPHS; CROSS-SELL; CUSTOMER LOYALTY; E-COMMERCE SITES; MASS CUSTOMIZATION; ON-LINE PERFORMANCE; PREFERENCE DATA; UP-SELL;

COLLABORATIVE FILTERING;

EID: 84974676821     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36233-9_15     Document Type: Conference Paper

References (23)

1. P Krishna Reddy and Masaru Kitsuregawa, An approach to relate the web communities through bipartite graphs, in proc. of the Second International Conference on Web Information Systems Engineering (WISE2001),IEEE Computer Society (2001)
2. P Krishna Reddy and Masaru Kitsuregawa, An approach to build a cybercommunity hierarchy, Workshop on Web Analytics, April 13, 2002, Arlington, Virginia, USA
3. Index of /Research/GroupLens/data, “http://www.cs.umn.edu/Research /GroupLens/data/”, May 2002
4. Goldberg, D., Nichols, D., Oki, B., Terry, D.: Using collaborative filtering to weave an information tapestry. Communications of the Association of Computing Machinery (1992) 35(12):61-70
5. Shardanand, U., Maes, P.: Social information filtering: Algorithms for automating word of mouth ”. In Proceedings of Conference on Human Factors in Computing Systems (CHI’95), Denver CO (1995) 210-217
6. Hill, W., Stead, L., Rosenstein, M., Furnas, G.: Recommending and Evaluating Choices in a Virtual Community of Use. In Proceedings of CHI, ACM Press (1995) 194-201
7. Konstan, J., Miller, B., Maltz, D., Herlocker, J., Gordon, L., Riedl, J.: Group Lens: Applying Collaborative Filtering to Usenet News. Communications of ACM (1997) 40(3):77-87
8. Resnick, P., Varian, H.R.: Recommender Systems. of Communications of ACM, (1997) 40(3)
9. Ben Schafer, J., Joseph Konstan, John Riedl: Recommender Systems in Ecommerce. In proceedings of ACM E-Commerce conference, (1999)
10. Badrul Sarvar, George Karypis, Joseph Konstan, and John Riedl:Analysis of recommendation algorithms for e-commerce, ACM Conference on Electronic Commerce (EC’00), October, Minneapolis, Minnesota, USA (2000) 17-20
11. John S Breese, David Heckerman, and Carl Kadie: Empirical Analysis of Predictive Algorithms for Collaborative filtering. Proceedings of the Conference on Uncertainity in Artificial Intelligence, (1998) 43-52
12. Connor, M.O., Herlocker, J.: Clustering items for collaborative filtering. In the proceedings of the AAAI Workshop on Recommendation Systems, (1999)
13. Ungar, L.H., Forster, D.P.: Clustering methods for collaborative filtering. In the proceedings of the AAAI workshop on recommendation systems, (1998)
14. Aggarwal, C.C., Wolf, J.L., Wu, K., Yu, P.S.: Horting Hatches an Egg: A New Graph-theoretic approach to Collaborative Filtering. In Proceedings of the ACM SIGKDD Conference (1999) 201-212
15. Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Item-based collaborative filtering recommendation algorithms. In the proceedings of 10th World Wide Web Conference, May 1-5, (2000)
16. Kleinberg, J., Authoritative sources in a hyperlinked environment, in proceedings of ACM-SIAM Symposium on Discrete Algorithms (1998)
17. D Gibson, J Kleinberg, P Raghavan. Inferring web communities from link topology, in proc. of ACM Conference on hypertext and hyper-media, 1998, 225-234
18. Ravi Kumar, S., Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: Trawling the Web for Emerging Cyber-Communities. WWW8 Computer Networks 31(11-16):1481-1493 (1999)
19. G W Flake, Steve Lawrence, C Lee Giles, Efficient identification of web communities, in proc. of 6th ACM SIGKDD, August 2000, 150-160
20. Jeffrey Dean, and Monica R Henzinger, Finding related pages in the world wide web. in proc. of 8th WWW conference, (1999)
21. Masashi Toyoda and Masaru Kitsuregawa, Creating a Web community chart for navigating related communities, in proc. of 12th ACM Conference on Hypertext and Hypermedia, August 2001, 103-112.
22. Goldberg, A.: Finding a maximum density subgraph, University of California, Berkeley, Technical report, CSD, (1984) 84-171
23. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In proceedings of VLDB (1994).