Sciweavers

1413 search results - page 103 / 283
» Mining Multiple Large Databases
Sort
View
ESANN
2004
15 years 3 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk
PAKDD
2009
ACM
103views Data Mining» more  PAKDD 2009»
15 years 8 months ago
Hot Item Detection in Uncertain Data
Abstract. An object o of a database D is called a hot item, if there is a sufficiently large population of other objects in D that are similar to o. In other words, hot items are ...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
150
Voted
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 4 months ago
Searching and mining trillions of time series subsequences under dynamic time warping
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
Thanawin Rakthanmanon, Bilson J. L. Campana, Abdul...
EUSFLAT
2007
105views Fuzzy Logic» more  EUSFLAT 2007»
15 years 3 months ago
SPoID: Do Not Throw Meaningful Incomplete Sequences Away!
Industrial databases often contain a large amount of unfilled information. During the knowledge discovery process one processing step is often necessary in order to remove these ...
Céline Fiot, Anne Laurent, Maguelonne Teiss...
ICDT
2009
ACM
129views Database» more  ICDT 2009»
16 years 2 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh