Overlapping community detection in networks: The state-of-the-art and comparative study
- Jierui Xie, Stephen Kelley, B. Szymanski
- Computer ScienceCSUR
- 26 October 2011
A framework is proposed for evaluating algorithms' ability to detect overlapping nodes, which helps to assess overdetection and underdetection, and for low overlapping density networks, SLPA, OSLOM, Game, and COPRA offer better performance than the other tested algorithms.
SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process
- Jierui Xie, B. Szymanski, Xiaoming Liu
- Computer ScienceIEEE 11th International Conference on Data Mining…
- 26 September 2011
A novel, general framework to detect and analyze both individual overlapping nodes and entire communities, in which nodes exchange labels according to dynamic interaction rules is presented.
Towards Linear Time Overlapping Community Detection in Social Networks
- Jierui Xie, B. Szymanski
- Computer SciencePacific-Asia Conference on Knowledge Discovery…
- 11 February 2012
A fast algorithm, called SLPA, for overlapping community detection in large-scale networks, which can be applied to both unipartite and bipartite networks and is able to uncover overlapping nested hierarchy.
In-network outlier detection in wireless sensor networks
- Joel W. Branch, C. Giannella, B. Szymanski, R. Wolff, H. Kargupta
- Computer Science, BusinessIEEE International Conference on Distributed…
- 4 July 2006
This work develops an approach that is flexible with respect to the outlier definition, computes the result in-network to reduce both bandwidth and energy consumption, uses only single-hop communication, thus permitting very simple node failure detection and message reliability assurance mechanisms, and seamlessly accommodates dynamic updates to data.
Community detection using a neighborhood strength driven Label Propagation Algorithm
- Jierui Xie, B. Szymanski
- Computer ScienceIEEE Network Science Workshop
- 17 May 2011
This paper proposes new update rule and label propagation criterion in LPA to improve both its computational efficiency and the quality of communities that it detects, and evaluates the generalization of the LPA update rule that takes into account, with varying strength, connections to the neighborhood of a node considering a new label.
Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks
- Zijian Wang, E. Bulut, B. Szymanski
- Computer ScienceIEEE International Conference on Communications
- 14 June 2009
An energy efficient and collision aware (EECA) node-disjoint multipath routing algorithm for wireless sensor networks that attempts to find two collision-free routes using constrained and power adjusted flooding and then transmits the data with minimum power needed through power control component of the protocol.
Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks
- E. Bulut, B. Szymanski
- Computer ScienceIEEE Transactions on Parallel and Distributed…
- 1 December 2012
A new metric is introduced that detects the quality of friendships between nodes accurately and defines the community of each node as the set of nodes having close friendship relations with this node either directly or indirectly.
Friendship Based Routing in Delay Tolerant Mobile Social Networks
- E. Bulut, B. Szymanski
- Computer ScienceIEEE Global Telecommunications Conference…
- 1 December 2010
Friendship Based Routing is presented, in which temporally differentiated friendships are used to make the forwarding decisions of messages and the introduced algorithm achieves better delivery rate while forwarding fewer messages than the existing algorithms.
Social consensus through the influence of committed minorities
- Jierui Xie, S. Sreenivasan, G. Korniss, W. Zhang, C. Lim, B. Szymanski
- MathematicsPhysical review. E, Statistical, nonlinear, and…
- 18 February 2011
We show how the prevailing majority opinion in a population can be rapidly reversed by a small fraction p of randomly distributed committed agents who consistently proselytize the opposing opinion…
Community Detection via Maximization of Modularity and Its Variants
- Mingming Chen, Konstantin Kuzmin, B. Szymanski
- Computer ScienceIEEE Transactions on Computational Social Systems
- 9 April 2014
This paper discusses the definition of modularity (Q) used as a metric for community quality and then it reviews the modularity maximization approaches which were used for community detection and introduces two novel fine-tuned community detection algorithms that iteratively attempt to improve the community quality measurements by splitting and merging the given network community structure.
...
...