Sciweavers

372 search results - page 15 / 75
» Mining the space of graph properties
Sort
View
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 9 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
GECCO
2003
Springer
14 years 1 months ago
Investigation of the Fitness Landscapes and Multi-parent Crossover for Graph Bipartitioning
An empirical study is performed on the local-optimum space of graph bipartitioning. We examine some statistical features of the fitness landscape. They include the cost-distance c...
Yong-Hyuk Kim, Byung Ro Moon
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
13 years 6 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
13 years 10 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 6 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...