Sciweavers

121 search results - page 11 / 25
» Algorithms for Large Scale Markov Blanket Discovery
Sort
View
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
13 years 8 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
ICDM
2005
IEEE
188views Data Mining» more  ICDM 2005»
14 years 1 months ago
CLUMP: A Scalable and Robust Framework for Structure Discovery
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
Kunal Punera, Joydeep Ghosh
RECOMB
2007
Springer
14 years 7 months ago
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
Joshua A. Grochow, Manolis Kellis
ESANN
2000
13 years 8 months ago
Distributed clustering and local regression for knowledge discovery in multiple spatial databases
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
Aleksandar Lazarevic, Dragoljub Pokrajac, Zoran Ob...
NIPS
1993
13 years 8 months ago
The Power of Amnesia
We propose a learning algorithm for a variable memory length Markov process. Human communication, whether given as text, handwriting, or speech, has multi characteristic time scal...
Dana Ron, Yoram Singer, Naftali Tishby