An improved Louvain algorithm for community detection

J Zhang, J Fei, X Song, J Feng - Mathematical Problems in …, 2021 - Wiley Online Library
Social network analysis has important research significance in sociology, business analysis,
public security, and other fields. The traditional Louvain algorithm is a fast community …

Multi-block dynamic weighted principal component regression strategy for dynamic plant-wide process monitoring

M Rong, H Shi, B Song, Y Tao - Measurement, 2021 - Elsevier
To properly monitor dynamic large-scale processes, a new distributed dynamic process
monitoring strategy named multi-block dynamic weighted principal component regression …

Dynamic vehicle routing for solid waste management

V Sreelekshmi, JJ Nair - 2017 IEEE Region 10 Symposium …, 2017 - ieeexplore.ieee.org
This work focuses on the changing demands which is contributed to dynamism and
complexity of the routing problems. Most of vehicle routing problems (VRP) have been …

A Novel Distributed Process Monitoring Framework of VAE-Enhanced with Deep Neural Network

M Yin, J Tian, Y Wang, J Jiang - Neural Processing Letters, 2024 - Springer
Intelligent manufacturing process needs to adopt distributed monitoring scenario due to its
massive, high-dimensional and complex data. Distributed process monitoring has been …

Improvised Apriori with frequent subgraph tree for extracting frequent subgraphs

JJ Nair, S Thomas - Journal of Intelligent & Fuzzy Systems, 2017 - content.iospress.com
Graphs are considered to be one of the best studied data structures in discrete mathematics
and computer science. Hence, data mining on graphs has become quite popular in the past …

Distributed process monitoring framework based on decomposed modified partial least squares

M Rong, H Shi, F Wang, S Tan - The Canadian Journal of …, 2019 - Wiley Online Library
With the growing complexity of industrial processes, the scale of production processes tends
to be large. The significant amount of measurement data in large‐scale processes poses …

ex-FTCD: A novel mapreduce model for distributed multi source shortest path problem

RG Gayathri, JJ Nair - Journal of Intelligent & Fuzzy Systems, 2018 - content.iospress.com
Computing the all pair shortest paths in a graph is a widely used solution, but a time-
consuming process too. The popularly used conventional algorithms rely solely on the …

Uncovering the relationship among overlapping communities

CM Aparna, JJ Nair - 2018 International Conference on …, 2018 - ieeexplore.ieee.org
In recent years, the real world complex network analysis has become an interesting
research area. Network consists of entities and links. Similar entities in a network falls into …

Influencing community detection using overlapping communities

CM Aparna, JJ Nairt - 2018 Fourth International Conference on …, 2018 - ieeexplore.ieee.org
In social network analysis and graph theory, influence node is a measure that used to
quantify the importance of a node in that network. Community is a collection of node …

Mapreduce model for finding closely knit communities in large scale networks

RG Gayathri, JJ Nair - 2017 International Conference on …, 2017 - ieeexplore.ieee.org
In this paper, we propose a scalable method for finding the evolving communities in complex
networks. The various network properties that are prominent in real-world networks are …