Sciweavers

499 search results - page 18 / 100
» A Search Algorithm for Clusters in a Network or Graph
Sort
View
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 8 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
14 years 21 days ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
ICPP
2009
IEEE
14 years 2 months ago
SkipStream: A Clustered Skip Graph Based On-demand Streaming Scheme over Ubiquitous Environments
Providing continuous on-demand streaming services with VCR functionality over ubiquitous environments is challenging due to the stringent QoS requirements of streaming service as ...
Qifeng Yu, Tianyin Xu, Baoliu Ye, Sanglu Lu, Daoxu...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
14 years 2 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...