Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Cluster Computing
Published in: Cluster Computing 2/2019

13-11-2017

Research on a large-scale community detection algorithm based on non-weighted graph

Author: AI Fang-ju

Published in: Cluster Computing | Special Issue 2/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Community detection and partitioning has become a critical issue in large-scale social networks. However, the applicability of most existing methods is limited by computational costs. In order to improve the quality of community division and calculation efficiency, a community detection algorithm based on un-weighted graphs is proposed. This algorithm uses two parameters to measure the community to achieve community discovery, which is clustering coefficient and common neighbor similarity, and its effectiveness is proved by the academic formula. Experimental analysis was carried out using a real social network dataset, and compared with other algorithms proposed two methods. The experimental results show that the proposed method is more efficient and the computation time is linear. It is suitable for community detection in large-scale social networks.
previous article An improved formalization analysis approach to determine schedulability of global multiprocessor scheduling based on symbolic safety analysis and statistical model checking in smartphone systems
next article Frame based multicast scheduling for buffered Clos-network switches

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
Literature
1.
2.
Li, Z., Zhang, S., Zhang, X.: Modularity and community detection in bipartite networks. Am. J. Oper. Res. 05(5), 421–434 (2015)MathSciNet
3.
Song, X., Geng, Y.: Distributed community detection optimization algorithm for complex networks. J. Netw. 9(10), 2758–2765 (2014)
4.
Huajian, Z., Youquan, W., Zhiang, W., et al.: Modularity optimization method for community detection based on local closenit structures. J. Southeast Univ. Nat. Sci. Ed. 44(3), 504–509 (2014)
5.
Da-peng, W., Xiao-hua, X., et al.: Node-belongingness dynamic estimate community detect strategy in opportunistic networks. Comput. Eng. Des. 33(10), 3673–3677 (2012)
6.
Jing, A.N., Sen, X.U.: Dynamic network community evolution analysis algorithm based on spectral clustering. Inf. Control 44(2), 197–202 (2015)
7.
Shang-fu, G., Wan-lu, C., et al.: The research of hierarchical clustering community detection algorithm. Appl. Res. Comput. 30(11), 3216–3220 (2013)
8.
Basuchowdhuri, P., Roy, R., Anand, S., et al.: Spanning tree-based fast community detection methods in social networks. Innov. Syst. Softw. Eng. 11(3), 177–186 (2015)CrossRef
9.
Sanlı, C., Lambiotte, R.: Local variation of hashtag spike trains and popularity in Twitter. PLoS ONE 10(7), 3–14 (2015)CrossRef
10.
Pengyuan, X., Yanzhong, D., et al.: Modified recommendation algorithm based on clustering coefficient. Appl. Res. Comput. 33(3), 654–656 (2016)
11.
Xin-Meng, Z., Sheng-Yi, J., et al.: Complex network community detection based on incremental clustering on core graph. Acta Automatica Sinica 39(7), 1117–1125 (2013)
12.
Youfang, L., Tianyu, W., et al.: An effective model and algorithm for community detection in social networks. J. Comput. Res. Develop. 49(2), 337–345 (2012)
13.
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1, 2 (2007)CrossRef
14.
Liu, J., Kerui, S., Qiang, G.: Solving the accuracy-diversity dilemma via directed random walks. Phys. Rev. 85(1), 016–018 (2012)CrossRef
15.
Lei, L., Jianguo, L., Jing, N., et al.: Effects of the high-order correlation on information filtering. Int. J. Modern Phys. 23(6), 125–145 (2012)
16.
Qiang, G., Feng, S., Zhaolong, H., et al.: Statistical properties of the personal social network in the 1facebook. Europhys. Lett. 104(2), 280–284 (2013)
17.
Tao, Z., Linyuan, L., Yicheng, Z.: Predicting missing links via local information. Eur. Phys. J. B 71(4), 623–630 (2009)CrossRef
18.
Linyuan, L., Cihang, J., Tao, Z.: Similarity index based on local paths for link prediction of complex networks. Phys. Rev. E 80(4), 046–052 (2009)
19.
Aggarwal, C.C., Xie, Y., Yu, P.S.: A framework for dynamic link prediction in heterogeneous networks \({\dagger }\). Stat. Anal. Data Mining 7(1), 14–33 (2014)
20.
Andersen, R., Chung, F., Lang, K.: Local graph partitioning using PageRank vectors. In: EOCS (2006) Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 475–486, (2006)
21.
Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. In: STOC ’04: Proceedings of the 36th annual ACM Symposium on Theory of Computing, pp. 222–231, (2004)
22.
Burer, S., Monteiro, R.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. (series B) 95(2), 329–357 (2003)MathSciNetCrossRef
23.
Chung, F.: Spectral graph theory, volume 92 of CBMS Regional Conference Series in Mathematics. American Mathematical Society, (1997)
24.
Flake, G., Tarjan, R., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Internet Math. 1(4), 385–408 (2003)MathSciNetCrossRef
25.
26.
Fortunato, S., Barthelemy, M.: Resolution limit in community detection. Proc. Natl. Acad. Sci. USA 104(1), 36–41 (2007)CrossRef
Metadata
Title
Research on a large-scale community detection algorithm based on non-weighted graph
Author
AI Fang-ju
Publication date
13-11-2017
Publisher
Springer US
Published in
Cluster Computing / Issue Special Issue 2/2019
Print ISSN: 1386-7857
Electronic ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-017-1326-1

Other articles of this Special Issue 2/2019

Cluster Computing 2/2019 Go to the issue

OriginalPaper

Research on college students’ information literacy based on big data

OriginalPaper

Research on early warning and monitoring algorithm of financial crisis based on fuzzy cognitive map

OriginalPaper

Decision making based on grey model and support vector machine

OriginalPaper

Modeling and predicting remanufacturing time of equipment using deep belief networks

OriginalPaper

A multiple heterogeneous kernel RVM approach for analog circuit fault prognostic

OriginalPaper

An effective mechanism for medical images authentication using quick response code

Premium Partner

    Image Credits