232 search results - page 26 / 47 » Fast High-Dimensional Data Search in Incomplete Databases |
KDD
1998
ACM
15 years 4 months ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
109
Voted
KDD
1997
ACM
15 years 3 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
KDD
2000
ACM
15 years 3 months ago
2000
ACM
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
106
click to vote
JASIS
2000
14 years 11 months ago
2000
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
103
click to vote
SSDBM
2003
IEEE
15 years 5 months ago
2003
IEEE
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...