Automated feature extraction from social media for systematic lead user identification

被引:16
作者
Pajo, Sanjin [1 ]
Vandevenne, Dennis [1 ]
Duflou, Joost R. [1 ]
机构
[1] Katholieke Univ Leuven, Ctr Ind Management, Celestijnlaan 300 Bus2422, B-3001 Heverlee, Belgium
关键词
Lead user identification; data mining; social networks; design management; COMMUNITIES; NETNOGRAPHY; PERSPECTIVE; ALGORITHM; FIRM;
D O I
10.1080/09537325.2016.1220517
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Manufacturers strive to rapidly develop novel products and offer solutions that meet the emerging customer needs. The Lead User Method, emerging from studies on sources of innovation by the scientific community, offers a validated approach to identify users with innovation ideas to support rapid and successful new product development process. The approach has been more recently applied on online communities, where collection and analysis of rich user data are performed by expert practitioners. In this paper, feature extraction techniques are outlined, that enable automated classification and identification of lead users that are present in online communities. The authors describe two case studies to construct a classification model that is then used to identify online lead users for confectionery products, and to evaluate the outlined feature extraction techniques. The presented research points to opportunities in automated identification within the lead user approach that further reduce the resource and time costs.
引用
收藏
页码:642 / 654
页数:13
相关论文
共 59 条
[1]   POSITIVE AND NEGATIVE BIASING SETS - THE EFFECTS OF PRIOR EXPERIENCE ON RESEARCH PERFORMANCE [J].
ALLEN, TJ ;
MARQUIS, DG .
IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, 1964, 11 (04) :158-161
[2]  
[Anonymous], BRAND EINS
[3]  
[Anonymous], TWITT SEARCH API TWI
[4]  
[Anonymous], DAT ENG WORKSH 2008
[5]  
[Anonymous], EXH STUD TWITT US WO
[6]  
[Anonymous], 2006, WORKING PAPER
[7]  
[Anonymous], 1998, FAST TRAINING SUPPOR
[8]  
[Anonymous], TWITT CO INF
[9]  
[Anonymous], 2011, Mining of Massive Datasets
[10]  
[Anonymous], 2000, Working Paper 4105