Sciweavers

2137 search results - page 229 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
STTT
2008
86views more  STTT 2008»
13 years 9 months ago
Properties of state spaces and their applications
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
Radek Pelánek
ICWSM
2008
13 years 10 months ago
Wikipedia as an Ontology for Describing Documents
Identifying topics and concepts associated with a set of documents is a task common to many applications. It can help in the annotation and categorization of documents and be used...
Zareen Saba Syed, Tim Finin, Anupam Joshi
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
13 years 7 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 7 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
JMLR
2002
111views more  JMLR 2002»
13 years 9 months ago
The Learning-Curve Sampling Method Applied to Model-Based Clustering
We examine the learning-curve sampling method, an approach for applying machinelearning algorithms to large data sets. The approach is based on the observation that the computatio...
Christopher Meek, Bo Thiesson, David Heckerman