Sciweavers

282 search results - page 37 / 57
» Generating non-redundant association rules
Sort
View
87
Voted
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
15 years 10 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
IQIS
2004
ACM
15 years 3 months ago
Mining for Patterns in Contradictory Data
Information integration is often faced with the problem that different data sources represent the same set of the real-world objects, but give conflicting values for specific prop...
Heiko Müller, Ulf Leser, Johann Christoph Fre...
SEMWEB
2001
Springer
15 years 2 months ago
A Scalable Framework for the Interoperation of Information Sources
Resolving heterogeneity among information systems is a crucial necessity if we wish to gain value from the many distributed resources available to us. Problems of heterogeneity in ...
Prasenjit Mitra, Gio Wiederhold, Stefan Decker
IDEAS
2007
IEEE
71views Database» more  IDEAS 2007»
15 years 4 months ago
Feature Space Enrichment by Incorporation of Implicit Features for Effective Classification
Feature Space Conversion for classifiers is the process by which the data that is to be fed into the classifier is transformed from one form to another. The motivation behind doin...
Abhishek Srivastava, Osmar R. Zaïane, Maria-L...
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
15 years 3 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu