Sciweavers

450 search results - page 70 / 90
» Mining Antagonistic Communities from Social Networks
Sort
View
DIS
2009
Springer
14 years 2 months ago
CHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
Min-Soo Kim 0002, Jiawei Han
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
14 years 2 months ago
A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
Kanishka Bhaduri, Ashok N. Srivastava
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 18 days ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 8 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
ISI
2005
Springer
14 years 1 months ago
Collecting and Analyzing the Presence of Terrorists on the Web: A Case Study of Jihad Websites
Abstract. The Internet which has enabled global businesses to flourish has become the very same channel for mushrooming ‘terrorist news networks.’ Terrorist organizations and t...
Edna Reid, Jialun Qin, Yilu Zhou, Guanpi Lai, Marc...