paper-with-me

홈 › Papers

A new nature inspired modularity function adapted for unsupervised learning involving spatially embedded networks: A comparative analysis

2020-07-18 · Raj Kishore, Zohar Nussinov, Kisor Kumar Sahu

Unsupervised machine learning methods can be of great help in many traditional engineering disciplines, where huge amount of labeled data is not readily available or is extremely difficult or costly to generate. Two specific examples include the structure of granular materials and atomic structure of metallic glasses. While the former is critically important for several hundreds of billion dollars global industries, the latter is still a big puzzle in fundamental science. One thing is common in both the examples is that the particles are the elements of the ensembles that are embedded in Euclidean space and one can create a spatially embedded network to represent their key features. Some recent studies show that clustering, which generically refers to unsupervised learning, holds great promise in partitioning these networks. In many complex networks, the spatial information of nodes play very important role in determining the network properties. So understanding the structure of such networks is very crucial. We have compared the performance of our newly developed modularity function with some of the well-known modularity functions. We performed this comparison by finding the best partition in 2D and 3D granular assemblies. We show that for the class of networks considered in this article, our method produce much better results than the competing methods.

📄 PDF Abstract BibTeX arXiv:2007.09330

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

Why don't the modules dominate - Investigating the Structure of a Well-Known Modularity-Inducing Problem Domain

2018-07-11 · Zhenyue Qin, Robert McKay, Tom Gedeon

Wagner's modularity inducing problem domain is a key contribution to the study of the evolution of modularity, including both evolutionary theory and evolutionary computation. We study its behavior under classical geneti…

Discovering Communities in Continuous-Time Temporal Networks by Optimizing L-Modularity

2025-10-01 · Victor Brabant, Angela Bonifati, Rémy Cazabet arxiv

Community detection is a fundamental problem in network analysis, with many applications in various fields. Extending community detection to the temporal setting with exact temporal accuracy, as required by real-world dy…

Community Detection

The application of Evolutionary and Nature Inspired Algorithms in Data Science and Data Analytics

2022-02-06 · Farid Ghareh Mohammadi, Farzan Shenavarmasouleh, Khaled Rasheed, Thiab Taha 외

In the past 30 years, scientists have searched nature, including animals and insects, and biology in order to discover, understand, and model solutions for solving large-scale science challenges. The study of bionics rev…

Clusteringfeature selection

Cancer Gene Profiling through Unsupervised Discovery

2021-02-11 · Enzo Battistella, Maria Vakalopoulou, Roger Sun, Théo Estienne 외

Precision medicine is a paradigm shift in healthcare relying heavily on genomics data. However, the complexity of biological interactions, the large number of genes as well as the lack of comparisons on the analysis of d…

Clustering

Recurrent Graph Neural Network Algorithm for Unsupervised Network Community Detection

2021-03-03 · Stanislav Sobolevsky

Network community detection often relies on optimizing partition quality functions, like modularity. This optimization appears to be a complex problem traditionally relying on discrete heuristics. And although the proble…

Community DetectionGraph Neural Network