Sciweavers

1768 search results - page 85 / 354
» Mining Very Large Databases
Sort
View
KDD
1998
ACM
148views Data Mining» more  KDD 1998»
15 years 2 months ago
Group Bitmap Index: A Structure for Association Rules Retrieval
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
Tadeusz Morzy, Maciej Zakrzewicz
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Characteristic relational patterns
Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While...
Arne Koopman, Arno Siebes
DASFAA
2008
IEEE
190views Database» more  DASFAA 2008»
15 years 4 months ago
Analysis of Time Series Using Compact Model-Based Descriptions
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
103
Voted
ICDM
2010
IEEE
217views Data Mining» more  ICDM 2010»
14 years 7 months ago
iSAX 2.0: Indexing and Mining One Billion Time Series
There is an increasingly pressing need, by several applications in diverse domains, for developing techniques able to index and mine very large collections of time series. Examples...
Alessandro Camerra, Themis Palpanas, Jin Shieh, Ea...
CINQ
2004
Springer
157views Database» more  CINQ 2004»
15 years 1 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut