Abstract
Community detection in social networks plays an important role in cluster analysis. Many traditional techniques for one-dimensional problems have been proven inadequate for high-dimensional or mixed type datasets due to the data sparseness and attribute redundancy. In this paper we propose a graph-based clustering method for multidimensional datasets. This novel method has two distinguished features: nonbinary hierarchical tree and the multi-membership clusters. The nonbinary hierarchical tree clearly highlights meaningful clusters, while the multimembership feature may provide more useful service strategies. Experimental results on the customer relationship management confirm the effectiveness of the new method. © 2013 Peixin Zhao et al.
Cite
CITATION STYLE
Zhao, P., Zhang, C. Q., Wan, D., & Zhang, X. (2013). A multidimensional and multimembership clustering method for social networks and its application in customer relationship management. Mathematical Problems in Engineering, 2013. https://doi.org/10.1155/2013/323750
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.