Interplay between success and patterns of human collaboration: case study of a Thai Research Institute

in Scientific Reports (2021)

Community Detection in Complex Networks: A Survey on Local Approaches

Scientific Conference (2021)

Early approaches of community detection algorithms often depend on the network’s global structure with a time complexity correlated to the network size. Local algorithms emerged as a more efficient ... [more ▼]

Early approaches of community detection algorithms often depend on the network’s global structure with a time complexity correlated to the network size. Local algorithms emerged as a more efficient solution to deal with large-scale networks with millions to billions of nodes. This methodology has shifted the attention from global structure towards the local level to deal with a network using only a portion of nodes. Investigating the state-of-the-art, we notice the absence of a standard definition of locality between community detection algorithms. Different goals have been explored under the local terminology of community detection approaches that can be misunderstood. This paper probes existing contributions to extract the scopes where an algorithm performs locally. Our purpose is to interpret the concept of locality in community detection algorithms. We propose a locality exploration scheme to investigate the concept of locality at each stage of an existing community detection workflow. We summarized terminologies concerning the locality in the state-of-the-art community detection approaches. In some cases, we observe how different terms are used for the same concept. We demonstrate the applicability of our algorithm by providing a review of some algorithms using our proposed scheme. Our review highlights a research gap in community detection algorithms and initiates new research topics in this domain. [less ▲]

Local Community Detection Algorithm with Self-defining Source Nodes

in Complex Networks & Their Applications IX (2020, September 01)

Surprising insights in community structures of complex networks have raised tremendous interest in developing various kinds of community detection algorithms. Considering the growing size of existing ... [more ▼]

Surprising insights in community structures of complex networks have raised tremendous interest in developing various kinds of community detection algorithms. Considering the growing size of existing networks, local community detection methods have gained attention in contrast to global methods that impose a top-down view of global network information. Current local community detection algorithms are mainly aimed to discover local communities around a given node. Besides, their performance is influenced by the quality of the source node. In this paper, we propose a community detection algorithm that outputs all the communities of a network benefiting from a set of local principles and a self-defining source node selection. Each node in our algorithm progressively adjusts its community label based on an even more restrictive level of locality, considering its neighbours local information solely. Our algorithm offers a computational complexity of linear order with respect to the network size. Experiments on both artificial and real networks show that our algorithm gains moreover networks with weak community structures compared to networks with strong community structures. Additionally, we provide experiments to demonstrate the ability of the self-defining source node of our algorithm by implementing various source node selection methods from the literature. [less ▲]

Privacy and Security of Big Data in AI Systems:A Research and Standards Perspective

in 2019 IEEE International Conference on Big Data (Big Data), 9-12 December 2019 (2020, February 24)

NGAP: a novel hybrid metaheuristic algorithm for round-trip carsharing fleet planning

in GECCO '20: Genetic and Evolutionary Computation Conference, Companion Volume, Cancún, Mexico, July 8-12, 2020 (2020)

Automated design of efficient swarming behaviours: a Q-learning hyper-heuristic approach

in GECCO '20: Genetic and Evolutionary Computation Conference, Companion Volume, Cancún, Mexico, July 8-12, 2020 (2020)

Design Challenges of Trustworthy Artificial Intelligence Learning Systems

in Intelligent Information and Database Systems - 12th Asian Conference ACIIDS 2020, Phuket, Thailand, March 23-26, 2020, Companion Proceedings (2020)

Competitive Evolution of a UAV Swarm for Improving Intruder Detection Rates

in 2020 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2020, New Orleans, LA, USA, May 18-22, 2020 (2020)

Optimizing the Performance of an Unpredictable UAV Swarm for Intruder Detection

in Optimization and Learning - Third International Conference, OLA 2020, Cádiz, Spain, February 17-19, 2020, Proceedings (2020)

Automatic Software Tuning of Parallel Programs for Energy-Aware Executions

in Proc. of 13th Intl. Conf. on Parallel Processing and Applied Mathematics (PPAM 2019) (2019, December)

For large scale systems, such as data centers, energy efficiency has proven to be key for reducing capital, operational expenses and environmental impact. Power drainage of a system is closely related to ... [more ▼]

For large scale systems, such as data centers, energy efficiency has proven to be key for reducing capital, operational expenses and environmental impact. Power drainage of a system is closely related to the type and characteristics of workload that the device is running. For this reason, this paper presents an automatic software tuning method for parallel program generation able to adapt and exploit the hardware features available on a target computing system such as an HPC facility or a cloud system in a better way than traditional compiler infrastructures. We propose a search based approach combining both exact methods and approximated heuristics evolving programs in order to find optimized configurations relying on an ever-increasing number of tunable knobs i.e., code transformation and execution options (such as the num- ber of OpenMP threads and/or the CPU frequency settings). The main objective is to outperform the configurations generated by traditional compiling infrastructures for selected KPIs i.e., performance, energy and power usage (for both for the CPU and DRAM), as well as the runtime. First experimental results tied to the local optimization phase of the proposed framework are encouraging, demonstrating between 8% and 41% improvement for all considered metrics on a reference benchmark- ing application (i.e., Linpack). This brings novel perspectives for the global optimization step currently under investigation within the presented framework, with the ambition to pave the way toward automatic tuning of energy-aware applications beyond the performance of the current state-of-the-art compiler infrastructures. [less ▲]