Sciweavers

131 search results - page 21 / 27
» Efficient Mining of Indirect Associations Using HI-Mine
Sort
View
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
14 years 7 months ago
Frequent term-based text clustering
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
Florian Beil, Martin Ester, Xiaowei Xu
DAWAK
1999
Springer
13 years 11 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
KES
2004
Springer
14 years 23 days ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran
IJAIT
2007
180views more  IJAIT 2007»
13 years 7 months ago
Detection and Prediction of Rare Events in Transaction Databases
Rare events analysis is an area that includes methods for the detection and prediction of events, e.g. a network intrusion or an engine failure, that occur infrequently and have s...
Christos Berberidis, Ioannis P. Vlahavas
JIIS
2000
111views more  JIIS 2000»
13 years 7 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...