Abstract
In E-commerce sites, recommendation systems are used to recommend products to their customers. Collaborative filtering (CF) is widely employed approach to recommend products. In the literature, researchers are making efforts to improve the scalability and online performance of CF. In this paper we propose a graph based approach to improve the performance of CF. We abstract a neighborhood community of a given customer through dense bipartite graph (DBG). Given a data set of customer preferences, a group of neighborhood customers for a given customer is extracted by extracting corresponding DBG. The experimental results on the MovieLens data set show that the recommendation made with the proposed approach matches closely with the recommendation of CF. The proposed approach possesses a potential to adopt to frequent changes in the product preference data set.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
P. Krishna Reddy and Masaru Kitsuregawa, An approach to build a cybercommunity hierarchy, Workshop on Web Analytics, April 13, 2002, Arlington, Virginia, USA
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
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
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
Konstan, J., Miller, B., Maltz, D., Herlocker, J., Gordon, L., Riedl, J.: GroupLens: Applying Collaborative Filtering to Usenet News. Communications of ACM (1997) 40(3):77–87
Resnick, P., Varian, H.R.: Recommender Systems. Special issue of Communications of ACM, (1997) 40(3)
Ben Schafer, J., Joseph Konstan, John Riedl: Recommender Systems in Ecommerce. In proceedings of ACM E-Commerce conference, (1999)
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
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
Connor, M.O., Herlocker, J.: Clustering items for collaborative filtering. In the proceedings of the AAAI Workshop on Recommendation Systems, (1999)
Ungar, L.H., Forster, D.P.: Clustering methods for collaborative filtering. In the proceedings of the AAAI workshop on recommendation systems, (1998)
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
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)
Kleinberg, J., Authoritative sources in a hyperlinked environment, in proceedings of ACM-SIAM Symposium on Discrete Algorithms (1998)
D. Gibson, J. Kleinberg, P. Raghavan. Inferring web communities from link topology, in proc. of ACM Conference on hypertext and hyper-media, 1998, pp. 225–234
RaviKumar, S., Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: Trawling the Web for Emerging Cyber-Communities. WWW8 Computer Networks 31(11–16):1481–1493 (1999)
G.W. Flake, Steve Lawrence, C. Lee Giles, Efficient identification of web communities, in proc. of 6th ACM SIGKDD, August 2000, pp.150–160
Jeffrey Dean, and Monica R. Henzinger, Finding related pages in the world wide web. in proc. of 8th WWW conference, (1999)
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, pp. 103–112.
Goldberg, A.: Finding a maximum density subgraph, University of California, Berkeley, Technical report, CSD,(1984)84–171
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules.In proceedings of VLDB (1994).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishna Reddy, P., Kitsuregawa, M., Sreekanth, P., Srinivasa Rao, S. (2002). A Graph Based Approach to Extract a Neighborhood Customer Community for Collaborative Filtering. In: Bhalla, S. (eds) Databases in Networked Information Systems. DNIS 2002. Lecture Notes in Computer Science, vol 2544. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36233-9_15
Download citation
DOI: https://doi.org/10.1007/3-540-36233-9_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00264-2
Online ISBN: 978-3-540-36233-3
eBook Packages: Springer Book Archive