Browse > Article
http://dx.doi.org/10.13088/jiis.2011.17.1.153

Managing Duplicate Memberships of Websites : An Approach of Social Network Analysis  

Kang, Eun-Young (Graduate School of Business IT, Kookmin University)
Kwahk, Kee-Young (School of Management Information Systems, College of Business Administration, Kookmin University)
Publication Information
Journal of Intelligence and Information Systems / v.17, no.1, 2011 , pp. 153-169 More about this Journal
Abstract
Today using Internet environment is considered absolutely essential for establishing corporate marketing strategy. Companies have promoted their products and services through various ways of on-line marketing activities such as providing gifts and points to customers in exchange for participating in events, which is based on customers' membership data. Since companies can use these membership data to enhance their marketing efforts through various data analysis, appropriate website membership management may play an important role in increasing the effectiveness of on-line marketing campaign. Despite the growing interests in proper membership management, however, there have been difficulties in identifying inappropriate members who can weaken on-line marketing effectiveness. In on-line environment, customers tend to not reveal themselves clearly compared to off-line market. Customers who have malicious intent are able to create duplicate IDs by using others' names illegally or faking login information during joining membership. Since the duplicate members are likely to intercept gifts and points that should be sent to appropriate customers who deserve them, this can result in ineffective marketing efforts. Considering that the number of website members and its related marketing costs are significantly increasing, it is necessary for companies to find efficient ways to screen and exclude unfavorable troublemakers who are duplicate members. With this motivation, this study proposes an approach for managing duplicate membership based on the social network analysis and verifies its effectiveness using membership data gathered from real websites. A social network is a social structure made up of actors called nodes, which are tied by one or more specific types of interdependency. Social networks represent the relationship between the nodes and show the direction and strength of the relationship. Various analytical techniques have been proposed based on the social relationships, such as centrality analysis, structural holes analysis, structural equivalents analysis, and so on. Component analysis, one of the social network analysis techniques, deals with the sub-networks that form meaningful information in the group connection. We propose a method for managing duplicate memberships using component analysis. The procedure is as follows. First step is to identify membership attributes that will be used for analyzing relationship patterns among memberships. Membership attributes include ID, telephone number, address, posting time, IP address, and so on. Second step is to compose social matrices based on the identified membership attributes and aggregate the values of each social matrix into a combined social matrix. The combined social matrix represents how strong pairs of nodes are connected together. When a pair of nodes is strongly connected, we expect that those nodes are likely to be duplicate memberships. The combined social matrix is transformed into a binary matrix with '0' or '1' of cell values using a relationship criterion that determines whether the membership is duplicate or not. Third step is to conduct a component analysis for the combined social matrix in order to identify component nodes and isolated nodes. Fourth, identify the number of real memberships and calculate the reliability of website membership based on the component analysis results. The proposed procedure was applied to three real websites operated by a pharmaceutical company. The empirical results showed that the proposed method was superior to the traditional database approach using simple address comparison. In conclusion, this study is expected to shed some light on how social network analysis can enhance a reliable on-line marketing performance by efficiently and effectively identifying duplicate memberships of websites.
Keywords
Duplicate Membership Management; Social Network Analysis; Sub Group; Component;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 Zhang, C., W. B. Chen, X. Chen, R. Tiwari, L. Yang and G. Warner, "A Multimodal Data Mining Framework for Revealing Common Sources of Spam Images", Journal of Multimedia, 2009.
2 Zhou, C., D. Frankowski, P. Ludford, S. Shekhar and L. Terveen, "Discovering Personal Gazetteers : An Interactive Clustering Approach", Proceedings of ACM GIS, 2004.
3 Girvan, M. and M. E. J. Newman, "Community structure in social and biological networks", Proc Natl Acad Sci USA, 2002.
4 Jaewon, C., H. J. Lee and Y. C. Kim, "The Influence of Social Presence on Evaluating Personalized Recommender System", 한국경영과학회 추계학술대회, 2008.
5 Joshi, D. and D. GaticaPerez, "Discovering Groups of People in Google News", Proceedings of the 1st ACM international workshop on Human-centered multimedia, 2006.
6 Kerschbaum, F. and A. Schaad, "Privacy-Preserving Social Network Analysis for Criminal Investigations", Alexandria, Virginia, USA, 2008.
7 Mccallum, A., A. Corrada-Emmanuel, and X. Wang, "Topic and Role Discovery in Social Networks", IJCAI, 2005.
8 Newman, M. E. J., "The structure and function of complex networks", SIAM Review, Vol. 45, No.2(2003), 167-256.   DOI   ScienceOn
9 김형도, "일관성 기반의 신뢰도 정의에 의한 협업 필터링", 한국전자거래학회지, 14권 1호(2009).
10 Chen, C., "Visualizaing Semantic Spaces and Author Co-Citation Networks in Digital Libraries", In Information Processing Management, Vol.35, No.3(1999).
11 박종학, 조윤호, 김재경, "사회연결망:신규고객 추천문제의 새로운 접근법", 지능정보연구, 15권 1호(2009).
12 손동원, 사회 네트워크 분석, 경문사, 2002.
13 안수산, 신경식, "데이터마이닝 기법을 활용한 스팸메일 분류 및 예측모형 구축에 관한 연구", 한국지능정보시스템학회, 7권 1호(2000).
14 위키백과사전, http://ko.wikipedia.org/wiki/협업 필터링.
15 Xu, J. and H. Chen, "Criminal Network Analysis and Visualization", Communications of the ACM, Vol.48, No.6(2005).
16 Rahman, M. A., A. El Saddik and W. Gueaieb, "Building Dynamic Social Network From Sensory Data Feed", IEEE Transactions on Instrumentation and Measurement, Vol.59, No.5(2010), 1327-1341.   DOI
17 Velardi, P., R. Navigli, A. Cucchiarelli and F. D'Antonio, "A New Content-Based Model for Social Network Analysis", Proceedings of the 2008 IEEE International Conference on Semantic Computing, (2008), 18-25.
18 Wennerberg, P. O., "Ontology Based Knowledge Discovery in Social Networks", Final Report, JRC Joint Research Center, 2005.
19 Faloutsos, C., K. McCurley and A. Tomkins, "Connection Subgraphs in Social Networks", SIAM International Conference on Data Mining, 2004.
20 Domingos, P. and M. Richardson, "Mining the network value of customers", KDD, (2001), 57-66.
21 Fawcett, T., "'In vivo' spam filtering : A challenge problem for data mining", Hewlett-Packard Laboratories 1501 Page Mill Road Palo Alto, CA USA, 2004.
22 이승훈, 김지혁, 김흥남, 조근식, "웹 기반 소셜 네트워크에서 시맨틱 관계 추론 및 시각화", 지능정보연구, 15권 1호(2009).
23 김용학, 사회연결망 분석, 박영사, 2003a.
24 김용학, 사회연결망 이론, 박영사, 2003b.
25 Newman, M. E. J., "Detecting community structure in networks", Eur. Phys. J. B., Vol.38 No.2(2004), 321-330.   DOI   ScienceOn
26 Newman, M. E. J., "Finding community structure in networks using the eigenvectors of matrices", Physical Review E., (2006), 74.
27 Palla, G., I. Derenyi, I. Farkas and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society", Nature, Vol.433(2005), 392-395.   DOI   ScienceOn
28 Frey, B. J. and D. Dueck, "Clustering by Passing Messages Between Data Points", Science, Vol.315(2007), 972-976.   DOI   ScienceOn
29 이승훈, 김지혁, 김흥남, 조근식, "가상 커뮤니티에서 사회 관계 추론을 위한 시맨틱 웹 접근 방법", 한국지능정보시스템학회 2007년도 추계학술대회(2007), 343-352.
30 Albert, R. and A.-L. Barabasi, "Statistical mechanics of complex networks", Rev. Mod. Phys., Vol.74(2002).
31 Butts, C. T., "Social network analysis : A methodological introduction", Asian Journal of Social Psychology, 2008.