Sciweavers

372 search results - page 17 / 75
» Mining the space of graph properties
Sort
View
FSTTCS
2009
Springer
14 years 4 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
SDM
2009
SIAM
192views Data Mining» more  SDM 2009»
14 years 7 months ago
Mining Cohesive Patterns from Graphs with Feature Vectors.
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
Arash Rafiey, Flavia Moser, Martin Ester, Recep Co...
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 10 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 11 months ago
Reconstruction from Randomized Graph via Low Rank Approximation
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
Leting Wu, Xiaowei Ying, Xintao Wu
ICML
2007
IEEE
14 years 10 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda