Sciweavers

1045 search results - page 75 / 209
» Data mining for discrimination discovery
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 9 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»
14 years 13 days 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
IPPS
2008
IEEE
14 years 3 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
DMKD
2003
ACM
96views Data Mining» more  DMKD 2003»
14 years 2 months ago
Using transposition for pattern discovery from microarray data
We analyze expression matrices to identify a priori interesting sets of genes, e.g., genes that are frequently co-regulated. Such matrices provide expression values for given biol...
François Rioult, Jean-François Bouli...
JDWM
2006
84views more  JDWM 2006»
13 years 8 months ago
Discovering Surprising Instances of Simpson's Paradox in Hierarchical Multidimensional Data
This paper focuses on the discovery of surprising, unexpected patterns, based on a data mining method that consists of detecting instances of Simpson's paradox. By its very n...
Carem C. Fabris, Alex Alves Freitas