Sciweavers

920 search results - page 73 / 184
» Relational Methodology for Data Mining and Knowledge Discove...
Sort
View
97
Voted
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 2 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
PKDD
2000
Springer
113views Data Mining» more  PKDD 2000»
15 years 5 months ago
CEM-Visualisation and Discovery in Email
Abstract. This paper presents a lattice-based visual metaphor for knowledge discovery in electronic mail. It allow a user to navigate email using a visual lattice metaphor rather t...
Richard J. Cole II, Peter W. Eklund, Gerd Stumme
BMCBI
2006
170views more  BMCBI 2006»
15 years 1 months ago
Biclustering of gene expression data by non-smooth non-negative matrix factorization
Background: The extended use of microarray technologies has enabled the generation and accumulation of gene expression datasets that contain expression levels of thousands of gene...
Pedro Carmona-Saez, Roberto D. Pascual-Marqui, Fra...
125
Voted
PKDD
2009
Springer
170views Data Mining» more  PKDD 2009»
15 years 8 months ago
Statistical Relational Learning with Formal Ontologies
Abstract. We propose a learning approach for integrating formal knowledge into statistical inference by exploiting ontologies as a semantically rich and fully formal representation...
Achim Rettinger, Matthias Nickles, Volker Tresp
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
15 years 3 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