ACM Home Page
Please provide us with feedback. Feedback
Ordering innovators and laggards for product categorization and recommendation
Full text PdfPdf (808 KB)
Source
ACM Conference On Recommender Systems archive
Proceedings of the third ACM conference on Recommender systems table of contents
New York, New York, USA
SESSION: Algorithms I table of contents
Pages 29-36  
Year of Publication: 2009
ISBN:978-1-60558-435-5
Authors
Sarah K. Tyler  Univ. of California, Santa Cruz, Santa Cruz, CA, USA
Shenghuo Zhu  NEC Laboratories America, Cupertino, CA, USA
Yun Chi  NEC Laboratories America, Cupertino, CA, USA
Yi Zhang  Univ. of California, Santa Cruz, Santa Cruz, CA, USA
Sponsor
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 27,   Downloads (12 Months): 27,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1639714.1639721
What is a DOI?

ABSTRACT

Different buyers exhibit different purchasing behaviors. Some rush to purchase new products while others tend to be more cautious, waiting for reviews from people they trust. In market analysis, the former group of buyers is often referred to as innovators and early adopters while the latter group is referred to as laggards. The adoption behavior is a dynamic feature of the user and varies over groups of products, e.g., innovators of literature may not be the innovators of electronics. The adoption order of users is a dynamic feature of the product, which can help to predict the future potential buyers. However, such dynamic features are usually unavailable in the description of products. In this paper, we study the user behavior of an online review website- Epinions.com. We first propose to model user adoption behaviors by creating a total ordering among users who rate the products in a given category. We develop a greedy algorithm and a Markov-chain based algorithm for computing the category total ordering. Next, we show that by using user behavior information, we can more accurately predict the category of a new product as well as predict which users will follow. Furthermore, by using the Epinion.com trust network as evidence, we demonstrate that our total ordering can group users into communities that closely resemble the trust network. Thus the adoption order can be a useful feature in recommendation systems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
W. W. Cohen, R. E. Schapire, and Y. Singer. Learning to order things. In Journal of Artificial Intelligence Research, volume 5, pages 243--270, 1999.
 
2
P. Domingos and M. Richardson. Mining the network value of customers. In Special Interests Groups, Knowledge Discovery and Data Mining(SIGKDD-2001), 2001.
 
3
Epinions.com. Epinions.com. http://www.epinions.com (Crawled in June, 2008), 2008.
 
4
D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In Special Interests Groups, Knowledge Discovery and Data Mining(SIGKDD-2003), 2003.
 
5
M. Kendall. A new measure of rank correlation. In Biometrika, volume 30, pages 81--89, 1938.
 
6
M. Kendall. Rank correlation methods. Charles Griffin & Company Limited, 1948.
 
7
G. Kossinets, J. Kleinberg, and D. Watts. The structure of information pathways in a social communication network. In Special Interests Groups, Knowledge Discovery and DataMining(SIGKDD-2008), 2008.
 
8
N. Liu and Q. Yang. Eignerank: A ranking-oriented approach to collaborative filtering. In Special Interests Groups, Information Retrieval (SIGIR-2008), 2008.
 
9
H. Ma, H. Yang, M. R. Lyu, and I. King. Mining Social networks using heat diffusion processes for marketing candidates selection. In ACM 17th Conference on Information and Knowledge Management (CIKM-2008), 2008.
 
10
Netflix. Netflix prize. http://www.netflixprize.com (visited on Nov. 30, 2006), 2006.
 
11
E. M. Rogers, editor. Diffusion of Innovations. The Free Pres: New York, 1995.
 
12
T. Rohan, T. J. Tunguz-zawislak, S. G. She er, and J. Harmsen. Network node ad targeting. In United States Patent Application 20080162260, 2008.
 
13
P. Rusmevichientong, S. Zhu, and D. Selinger. Identifying early buyers from purchase data. In Special Interests Groups, Knowledge Discovery and Data Mining(SIGKDD-2004), 2004.
 
14
X. Song, Y. Chi, K. Hino, and B. L. Tseng. Information flow modeling based on diffusion rate of prediction and ranking. In World Wide Web Conference(WWW-2007), 2007.
 
15
X. Song, B. L. Tseng, C. Y. Lin, and M. T. Sun. Personalized recommendation driven by information flow. In Special Interests Groups, Information Retrieval (SIGIR-2006), 2006.
 
16
S. K. Tyler and Y. Zhang. Open domain recommendation: Social networks and collaborative filtering. Advanced Data Mining And Applications (ADMA-2008), 2008.
 
17
D. J. Watts and S. Strogatz. Collective dynamics of 'small-world' networks. In Nature 393, pages 440--442, 1998.
 
18
Y. Yao. Hodge decomposition, spectral embedding, and the netflix dataset. In Workshop on Algorithms for Modern Massive Data Sets(MMDS-2008), 2008.