메뉴 건너뛰기




Volumn , Issue , 2004, Pages 671-676

Identifying early buyers from purchase data

Author keywords

Consumer behavior; Early buyers; Semidefinite programming; Social network

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BENCHMARKING; DATA MINING; FORECASTING; GRAPH THEORY; LIFE CYCLE; MATHEMATICAL MODELS; PROBLEM SOLVING; SALES;

EID: 12244267307     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014138     Document Type: Conference Paper
Times cited : (10)

References (8)
  • 1
    • 84880468771 scopus 로고    scopus 로고
    • Mining newsgroup using networks arising from social behavior
    • May 20-24, Budapest, Hungary
    • R. Agrawal, S. Rajagopalan, R. Srikant, and Y. Xu, "Mining Newsgroup Using Networks Arising From Social Behavior," WWW Conf., May 20-24, 2003, Budapest, Hungary.
    • (2003) WWW Conf.
    • Agrawal, R.1    Rajagopalan, S.2    Srikant, R.3    Xu, Y.4
  • 2
    • 0001449665 scopus 로고
    • A new product growth model for consumer durables
    • Jan
    • F. M. Baas, "A New Product Growth Model for Consumer Durables," Management Science, 15 Jan 1969, pp. 215-227.
    • (1969) Management Science , vol.15 , pp. 215-227
    • Baas, F.M.1
  • 3
    • 12244269499 scopus 로고    scopus 로고
    • DSDP4: A software package implementing the dual-scaling algorithm for semidefinite programming
    • Argonne National Laboratory, Argonne, IL, June Software downloadable from
    • S. Benson and Y. Ye, "DSDP4: A software package implementing the dual-scaling algorithm for semidefinite programming," Tech Report ANL/MCS-TM-255, Argonne National Laboratory, Argonne, IL, June 2002. Software downloadable from http://www-unix.mcs.anl.gov/~benson/
    • (2002) Tech Report , vol.ANL-MCS-TM-255
    • Benson, S.1    Ye, Y.2
  • 4
    • 0035789667 scopus 로고    scopus 로고
    • Mining the network value of customers
    • P. Domingos and M. Richardson, "Mining the Network Value of Customers," KDD 2001.
    • (2001) KDD
    • Domingos, P.1    Richardson, M.2
  • 5
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • M. Goemans and D. Williamson, "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming," J. of the ACM, vol. 42, pp. 1115-1145, 1995.
    • (1995) J. of the ACM , vol.42 , pp. 1115-1145
    • Goemans, M.1    Williamson, D.2
  • 6
    • 0032348338 scopus 로고    scopus 로고
    • When is it worthwhile targeting the majority instead of the innovators in a new product launch?
    • Nov
    • V. Mahajan and E. Muller, "When Is It Worthwhile Targeting the Majority Instead of the Innovators in a New Product Launch?," J. of Marketing Research, 35, pp. 488-95, Nov 1998.
    • (1998) J. of Marketing Research , vol.35 , pp. 488-495
    • Mahajan, V.1    Muller, E.2
  • 7
    • 0003389570 scopus 로고
    • Determination of adopter categories by using innovation diffusion models
    • V. Mahajan, E. Muller, and R. K. Srivastava, "Determination of Adopter Categories by Using Innovation Diffusion Models," J. of Marketing Research, 27, pp. 37-50, 1990.
    • (1990) J. of Marketing Research , vol.27 , pp. 37-50
    • Mahajan, V.1    Muller, E.2    Srivastava, R.K.3
  • 8
    • 0242456823 scopus 로고    scopus 로고
    • Mining knowledge-sharing sites for viral marketing
    • M. Richardson and P. Domingos, "Mining Knowledge-Sharing Sites for Viral Marketing," KDD 2002.
    • (2002) KDD
    • Richardson, M.1    Domingos, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.