KDD
1997
ACM
14 years 23 days ago
1997
ACM
We address the problem of nding useful regions for two-dimensional association rules and decision trees. In a previous paper we presented ecient algorithms for computing optimiz...
KDD
1997
ACM
14 years 23 days ago
1997
ACM
KDD
1997
ACM
14 years 23 days ago
1997
ACM
We present a novel data mining approach based on decomposition. In order to analyze a given dataset, the method decomposes it to a hierarchy of smaller and less complex datasets t...
KDD
1997
ACM
14 years 23 days ago
1997
ACM
KDD
1997
ACM
14 years 23 days ago
1997
ACM
KDD (Knowledge Discovery in Databases) processhas become a new and important research area. Within the framework of KDD process and the GLS (Global Learning Scheme) system recentl...
KDD
1997
ACM
14 years 23 days ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
KDD
1997
ACM
14 years 23 days ago
1997
ACM
Feature selection is a data preprocessing step for classi cation and data mining tasks. Traditionally, feature selection is done by selecting a minimum number of features that det...
KDD
1997
ACM
14 years 23 days ago
1997
ACM
To formulate a meaningful query on semistructured data, such as on the Web, that matches some of the source’s structure, we need first to discover something about how the infor...
KDD
1997
ACM
14 years 23 days ago
1997
ACM
KDD
1997
ACM
14 years 23 days ago
1997
ACM
Efficient discover of association rules in large databases is a we 1 studied problem and several ap-1y proaches have been proposed. However, it is non trivial to maintain the asso...