Sciweavers

286 search results - page 29 / 58
» Mining Association Rules in Hypertext Databases
Sort
View
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
14 years 9 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
DBPL
2001
Springer
118views Database» more  DBPL 2001»
14 years 1 months ago
On Monotone Data Mining Languages
Abstract. We present a simple Data Mining Logic (DML) that can express common data mining tasks, like “Find Boolean association rules” or “Find inclusion dependencies.” At ...
Toon Calders, Jef Wijsen
DATAMINE
2006
131views more  DATAMINE 2006»
13 years 8 months ago
A systematic approach to the assessment of fuzzy association rules
In order to allow for the analysis of data sets including numerical attributes, several generalizations of association rule mining based on fuzzy sets have been proposed in the li...
Didier Dubois, Eyke Hüllermeier, Henri Prade
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
14 years 1 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
KDD
1997
ACM
122views Data Mining» more  KDD 1997»
14 years 28 days ago
Computing Optimized Rectilinear Regions for Association Rules
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...
Kunikazu Yoda, Takeshi Fukuda, Yasuhiko Morimoto, ...