Sciweavers

917 search results - page 105 / 184
» Mining interesting sets and rules in relational databases
Sort
View
ACSC
2007
IEEE
15 years 4 months ago
On Inferences of Full Hierarchical Dependencies
Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its ...
Sven Hartmann, Sebastian Link
SDM
2004
SIAM
141views Data Mining» more  SDM 2004»
14 years 11 months ago
Visually Mining through Cluster Hierarchies
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer aid...
Stefan Brecheisen, Hans-Peter Kriegel, Peer Kr&oum...
SAC
2010
ACM
15 years 4 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
15 years 4 months ago
Finding Associations and Computing Similarity via Biased Pair Sampling
Sampling-based methods have previously been proposed for the problem of finding interesting associations in data, even for low-support items. While these methods do not guarantee ...
Andrea Campagna, Rasmus Pagh
VLDB
2004
ACM
143views Database» more  VLDB 2004»
15 years 3 months ago
GPX: Interactive Mining of Gene Expression Data
Discovering co-expressed genes and coherent expression patterns in gene expression data is an important data analysis task in bioinformatics research and biomedical applications. ...
Daxin Jiang, Jian Pei, Aidong Zhang