Skip to main content
SpringerLink
Log in

The application of parallel clustering analysis based on big data mining in physical community discovery

  • Original article
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

Abstract

To improve the performcance of community discovery algorithm applied to dynamic community detection objects, a parallel clustering analysis based on packet permission hierarchical association mining in community discovery of big data has been proposed. First, an evolutionary non-negative matrix decomposition framework based on clustering quality is proposed for dynamic community detection. Second, a clustering combined with dynamic pruning binary tree support vector machine (SVM) algorithm is proposed to prove the equivalence between evolutionary binary tree clustering and evolutionary module density optimization from the perspective of theoretical analysis. Based on this equivalence, a new semi-supervised association mining algorithm is proposed by adding prior information to the sample data without increasing the time complexity. Finally, through the experimental analysis on the static and dynamic community detection model, the performance advantage of the proposed algorithm on the community detection performance index is verified.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Akçay MB, Oğuz K (2020) Speech emotion recognition: emotional models, databases, features, preprocessing methods, supporting modalities, and classifiers[J]. Speech Commun 116:56–76

    Article  Google Scholar 

  • Amelio A, Pizzuti C (2017) Correction for closeness: Adjusting normalized mutual information measure for clustering comparison[J]. Comput Intell 33(3):579–601

    Article  MathSciNet  Google Scholar 

  • Baierle IC, Benitez GB, Nara EOB et al (2020) Influence of open innovation variables on the competitive edge of small and medium enterprises[J]. Journal of Open Innovation: Technology, Market, and Complexity 6(4):179

    Article  Google Scholar 

  • Daoudi M, Hamena S, Benmounah Z, et al. Parallel diffrential evolution clustering algorithm based on MapReduce[C]// Soft Computing & Pattern Recognition. 2015.

  • Fumanal-Idocin J, Alonso-Betanzos A, Cordón O et al (2020) Community detection and social network analysis based on the Italian wars of the 15th century[J]. Futur Gener Comput Syst 113:25–40

    Article  Google Scholar 

  • Gowanlock M, Blair DM, Pankratius V (2017) Optimizing parallel clustering throughput in shared memory[J]. IEEE Trans Parallel Distrib Syst 28(9):2595–2607

    Article  Google Scholar 

  • Grünwald PD, Mehta NA (2020) Fast Rates for General Unbounded Loss Functions: From ERM to Generalized Bayes[J]. J Mach Learn Res 21(56):1–56

    MathSciNet  MATH  Google Scholar 

  • Gui Q, Deng R, Xue P et al (2018) A community discovery algorithm based on boundary nodes and label propagation[J]. Pattern Recogn Lett 109:103–109

    Article  Google Scholar 

  • He T, Cai L, Meng T et al (2018a) Parallel community detection based on distance dynamics for large-scale network[J]. IEEE Access 6:42775–42789

    Article  Google Scholar 

  • He C, Fei X, Li H et al (2018b) Improving NMF-based community discovery using distributed robust nonnegative matrix factorization with SimRank similarity measure[J]. J Supercomput 74(10):5601–5624

    Article  Google Scholar 

  • Jiang L, Shi L, Liu L et al (2019) An efficient evolutionary user interest community discovery model in dynamic social networks for internet of people[J]. IEEE Internet Things J 6(6):9226–9236

    Article  Google Scholar 

  • Jin S Y, Boulware D, Kimmey D. A Parallel Spatial Co-location Mining Algorithm Based on MapReduce[C]// IEEE International Congress on Big Data. 2014.

  • Kong X, Chen Y, Hui T, et al. A Novel Botnet Detection Method Based on Preprocessing Data Packet by Graph Structure Clustering[C]// International Conference on Cyber-enabled Distributed Computing & Knowledge Discovery. 2017.

  • Li L, Wang W, Xu X (2017) Multi-objective particle swarm optimization based on global margin ranking[J]. Inf Sci 375:30–47

    Article  Google Scholar 

  • Liu H, Linghu F, Jian J et al (2017a) Overlapping community discovery algorithm based on hierarchical agglomerative clustering[J]. Int J Pattern Recognit Artif Intell 32(03):3

    MathSciNet  Google Scholar 

  • Liu C, Bu W, Xu D (2017b) Multi-objective shape optimization of a plate-fin heat exchanger using CFD and multi-objective genetic algorithm[J]. Int J Heat Mass Transf 111:65–82

    Article  Google Scholar 

  • Ma Z, Ma Z, Yuan H. 2020 Universal Latent Space Model Fitting for Large Networks with Edge Covariates[J]. J Mach Learn Res 21(67): 4: 1–4.

  • McKenna JE Jr (2003) An enhanced cluster analysis program with bootstrap significance testing for ecological community analysis[J]. Environ Model Softw 18(3):205–220

    Article  Google Scholar 

  • Qian X, Yang C. 2016 Large data parallel clustering algorithm based on discovery of maximal class in the community[J]. Journal of Nanjing University of Science and Technology

  • Rahimi S, Abdollahpouri A, Moradi P (2018) A multi-objective particle swarm optimization algorithm for community detection in complex networks[J]. Swarm Evol Comput 39:297–309

    Article  Google Scholar 

  • Rossetti G, Cazabet R (2018) Community discovery in dynamic networks: a survey[J]. ACM Computing Surveys (CSUR) 51(2):1–37

    Article  Google Scholar 

  • Rossetti G, Pappalardo L, Pedreschi D et al (2017) Tiles: an online algorithm for community discovery in dynamic social networks[J]. Mach Learn 106(8):1213–1241

    Article  MathSciNet  Google Scholar 

  • Shojaei A, Galvanetto U, Rabczuk T et al (2019) A generalized finite difference method based on the Peridynamic differential operator for the solution of problems in bounded and unbounded domains[J]. Comput Methods Appl Mech Eng 343:100–126

    Article  MathSciNet  MATH  Google Scholar 

  • Tan L, Huang S, Zhang Z (2019) Parallel Animal Classification Analysis Based on Hierarchical Association Mining[J]. Revista Científica De La Facultad De Ciencias Veterinarias 29(5):1397–1406

    Google Scholar 

  • Tew C, Giraud-Carrier C, Tanner K et al (2014) Behavior-based clustering and analysis of interestingness measures for association rule mining[J]. Data Min Knowl Disc 28(4):1004–1045

    Article  MathSciNet  MATH  Google Scholar 

  • Toğaçar M, Ergen B, Cömert Z (2020) Waste classification using AutoEncoder network with integrated feature selection method in convolutional neural network models[J]. Measurement 153:107459

    Article  Google Scholar 

  • Xin M, Wang Y (2019) Research on image classification model based on deep convolution neural network[J]. EURASIP Journal on Image and Video Processing 2019(1):1–11

    Article  Google Scholar 

  • Zhou X, Huang Y. 2014 An improved parallel association rules algorithm based on MapReduce framework for big data[C]// International Conference on Fuzzy Systems & Knowledge Discovery

Download references

Funding

This work received no fundings.

Author information

Authors and Affiliations

  1. Nanchang University College of Science and Technology, Gongqingcheng, 330029, China

    Fan Wu & Rui Zhou

Authors
  1. Fan Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rui Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

All authors listed have made a substantial, direct and intellectual contribution to the work, and approved it for publication.

Corresponding author

Correspondence to Rui Zhou.

Ethics declarations

Conflict of interest

All Authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Informed consent

Informed consent was obtained from all individual participants included in the study.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, F., Zhou, R. The application of parallel clustering analysis based on big data mining in physical community discovery. Int J Syst Assur Eng Manag 13 (Suppl 3), 1054–1062 (2022). https://doi.org/10.1007/s13198-021-01306-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-021-01306-5

Keywords

Search

Navigation