1314 search results - page 105 / 263 » Approximate data mining in very large relational data |
117
click to vote
BMCBI
2007
15 years 1 months ago
2007
Background: Data clustering analysis has been extensively applied to extract information from gene expression profiles obtained with DNA microarrays. To this aim, existing cluster...
109
click to vote
DAWAK
2005
Springer
15 years 7 months ago
2005
Springer
This paper proposes the compression of data in Relational Database Management Systems (RDBMS) using existing text compression algorithms. Although the technique proposed is general...
115
click to vote
KDD
1999
ACM
15 years 6 months ago
1999
ACM
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
99
Voted
SIGKDD
2002
15 years 1 months ago
2002
Genomics data has many properties that make it different from "typical" relational data. The presence of multi-valued attributes as well as the large number of null valu...
104
click to vote
VLDB
2010
ACM
15 years 3 days ago
2010
ACM
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...