Kalaichelvi Nallusamy^*, K. S. Easwarakumar

Intelligent Automation & Soft Computing, Vol.31, No.2, pp. 749-765, 2022, DOI:10.32604/iasc.2022.020189

Abstract Community Detection is used to discover a non-trivial organization of the network and to extract the special relations among the nodes which can help in understanding the structure and the function of the networks. However, community detection in social networks is a vast and challenging task, in terms of detected communities accuracy and computational overheads. In this paper, we propose a new algorithm Enhanced Algorithm for Community Detection in Social Networks – CGraM, for community detection using the graph measures eccentricity, harmonic centrality and modularity. First, the centre nodes are identified by using the eccentricity and harmonic centrality, next a… More >

Kuan-Peng Chen^1,3, An-Cheng Yang^1,3, Wen-Jay Lee¹, Yi-Ming Tseng², Nien-Ti Tsou², Nan-Yow Chen^1,*

The International Conference on Computational & Experimental Engineering and Sciences, Vol.21, No.3, pp. 54-54, 2019, DOI:10.32604/icces.2019.05401

Abstract Crystallographic classification of microstructure is a very important issue in material science especially numerous data were generated by experiments or Molecular Dynamic (MD) simulations. Some analysis tools were purposed, such as coordination analysis and Honeycutt-Anderson (HA) pair analysis [1], however, to analyze these huge amounts of data is still quite difficult. Sometimes, crystallography prior knowledge of their structures is also desired in the classification procedures. Not only the task is very labor intensive but also the result is susceptible to errors and is usually lack of objectivity. In this study, we developed a computational workflow which can get characteristic quantities… More >