期刊文献+

基于谱聚类的用户关联关系挖掘 被引量:1

User Association Mining Based on Spectral Clustering
下载PDF
导出
摘要 为了从用户地理空间分布数据中挖掘用户间关联关系,提出了一种基于谱聚类的关联关系挖掘算法。首先定义了关联度,用以衡量用户之间空间分布的相似性,基于关联度构造相似矩阵,再利用谱聚类方法对用户进行聚类分析,聚类结果表征了用户的关联关系。采用Silhouette指标和聚类准确率来衡量用户关系挖掘质量,同时与传统的K-Means方法进行了比较,通过真实数据集实验,结果表明该算法在实验数据集上能达到90%以上的聚类准确率,证明方法有效、可行。 For mining association relationship from user's geographical spatial distribution data,a new method based on spectral clustering is proposed. Firstly,the correlation degree is defined,which is used to measure the similarity of spatial distribution of users,and then the similarity matrix is constructed. Clustering analysis is conducted by using spectral clustering method,and the relationship between users is characterized by clustering results. The Silhouette index and clustering accuracy are used to measure the quality of user relationship mining,meanwhile the traditional K- Means method is compared with the proposed algorithm. Experiments on real data set show that the algorithm can achieve more than 90% of the clustering accuracy,indicating that the method is effective and feasible.
出处 《电讯技术》 北大核心 2016年第1期32-37,共6页 Telecommunication Engineering
关键词 用户行为分析 用户关系挖掘 谱聚类 关联度 K-MEANS user behavior analysis user association mining spectral clustering correlation degree K-Means
  • 相关文献

参考文献10

  • 1GUAN T,WANG K R,ZHANG S P. A robust periodicitymining method from incomplete and noisy observationsbased on relative entropy[J]. International Journal of Ma-chine Learning and Cybernetics,2015,6(2):1-11.
  • 2GOEL A,MALLICK B. Customer purchasing behavior usingsequential pattern mining technique[J]. International Jour-nal of Computer Applications,2015,119(1):1-5.
  • 3SINATRA R,SZELL M. Entropy and the predictability ofonline life[J]. Entropy,2014,16(1):543-556.
  • 4PHITHAKKITNUKOON S,HUSNA H,DANTU R. Be-havioral entropy of a cellular phone user [M] / / SocialComputing, Behavioral Modeling, and Prediction. NewYork:Springer,2008:160-167.
  • 5CRANDALL D J,BACKSTROM L,COSLEY D,et al. In-ferring social ties from geographic coincidences[J]. Pro-ceedings of the National Academy of Sciences,2010,107(52):22436-22441.
  • 6EAGLE N,PENTLAND A S,LAZER D. Inferring friend-ship network structure by using mobile phone data[J].Proceedings of the National Academy of Sciences,2009,106(36):15274-15278.
  • 7TARTARE G,HAMAD D,AZAHAF M,et al. Spectralclustering applied for dynamic contrast-enhanced MR a-nalysis of time-intensity curves[J]. Computerized Medi-cal Imaging and Graphics,2014,38(8):702-713.
  • 8SNCHEZ-GARCA R J,FENNELLY M,NORRIS S,et al.Hierarchical spectral clustering of power grids [J]. IEEETransactions on Power Systems,2014,29(5):2229-2237.
  • 9LUXBURG U. A tutorial on spectral clustering[J]. Sta-tistics and Computing,2007,17(4):395-416.
  • 10AMORIM R C,HENNIG C. Recovering the number ofclusters in data sets with noise features using feature res-caling factors[J]. Information Sciences,2015,324(12):126-145.

同被引文献11

引证文献1

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部