Partitioning networks into communities by message passing

Community Detection in Social Networks Using Affinity Propagation with Adaptive Similarity Matrix

Community detection problem is a projection of data clustering where the network's topological properties are only considered for measuring similarities among nodes. Also, finding communities' kernel nodes and expanding a community from kernel will certainly help us to find optimal communities. Among the existing community detection approaches, the affinity propagation (AP)-based method has been showing promising results and does not require any predefined information such as the number of clusters (communities). AP is an exemplar-based clustering method that defines the negative real-valued similarity measure sim(i, k) between data point i and exemplar k as the probability of k being the exemplar of data point i. According to our intuition, the value of sim(i, k) should not be identical to sim(k, i). In this study, a new version of AP using an adaptive similarity matrix, namely affinity propagation with adaptive similarity (APAS) matrix, is proposed, which could efficiently show the leadership probabilities between data points. APAS can adaptively transform the symmetric similarity matrix into an asymmetric one. It outperforms AP method in terms of accuracy. Extensive experiments conducted on artificial and real-world networks demonstrate the effectiveness of our approach.

The greater inflammatory pathway-high clinical potential by innovative predictive, preventive, and personalized medical approach

BACKGROUND AND LIMITATIONS

Impaired wound healing (WH) and chronic inflammation are hallmarks of non-communicable diseases (NCDs). However, despite WH being a recognized player in NCDs, mainstream therapies focus on (un)targeted damping of the inflammatory response, leaving WH largely unaddressed, owing to three main factors. The first is the complexity of the pathway that links inflammation and wound healing; the second is the dual nature, local and systemic, of WH; and the third is the limited acknowledgement of genetic and contingent causes that disrupt physiologic progression of WH.

PROPOSED APPROACH

Here, in the frame of Predictive, Preventive, and Personalized Medicine (PPPM), we integrate and revisit current literature to offer a novel systemic view on the cues that can impact on the fate (acute or chronic inflammation) of WH, beyond the compartmentalization of medical disciplines and with the support of advanced computational biology.

CONCLUSIONS

This shall open to a broader understanding of the causes for WH going awry, offering new operational criteria for patients' stratification (prediction and personalization). While this may also offer improved options for targeted prevention, we will envisage new therapeutic strategies to reboot and/or boost WH, to enable its progression across its physiological phases, the first of which is a transient acute inflammatory response versus the chronic low-grade inflammation characteristic of NCDs.

Community-aware task allocation for social networked multiagent systems

In this paper, we propose a novel community-aware task allocation model for social networked multiagent systems (SN-MASs), where the agent' cooperation domain is constrained in community and each agent can negotiate only with its intracommunity member agents. Under such community-aware scenarios, we prove that it remains NP-hard to maximize system overall profit. To solve this problem effectively, we present a heuristic algorithm that is composed of three phases: 1) task selection: select the desirable task to be allocated preferentially; 2) allocation to community: allocate the selected task to communities based on a significant task-first heuristics; and 3) allocation to agent: negotiate resources for the selected task based on a nonoverlap agent-first and breadth-first resource negotiation mechanism. Through the theoretical analyses and experiments, the advantages of our presented heuristic algorithm and community-aware task allocation model are validated. 1) Our presented heuristic algorithm performs very closely to the benchmark exponential brute-force optimal algorithm and the network flow-based greedy algorithm in terms of system overall profit in small-scale applications. Moreover, in the large-scale applications, the presented heuristic algorithm achieves approximately the same overall system profit, but significantly reduces the computational load compared with the greedy algorithm. 2) Our presented community-aware task allocation model reduces the system communication cost compared with the previous global-aware task allocation model and improves the system overall profit greatly compared with the previous local neighbor-aware task allocation model.