KDD
1997
ACM
13 years 9 months 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
13 years 9 months 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
13 years 9 months 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
13 years 9 months ago
1997
ACM
KDD
1997
ACM
13 years 9 months 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...
KDD
1997
ACM
13 years 9 months ago
1997
ACM
KDD
1997
ACM
13 years 9 months ago
1997
ACM
In this paper, we describe the JAM system, a distributed, scalable and portable agent-based data mining system that employs a general approach to scaling data mining applications ...
KDD
1997
ACM
13 years 9 months ago
1997
ACM
The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice...
KDD
1997
ACM
13 years 9 months ago
1997
ACM
Thereis a wealthof informationto be minedfromnarrative text on the WorldWideWeb.Unfortunately, standard natural language processing (NLP)extraction techniques expect full, grammat...
KDD
1997
ACM
13 years 9 months ago
1997
ACM
Exploratory data analysis is inherently an iterative, interactive endeavor. In the context of massive data sets, however, many current data analysis algorithms will not scale appr...