Sciweavers

588 search results - page 73 / 118
» Discovering data quality rules
Sort
View
DATAMINE
2010
133views more  DATAMINE 2010»
13 years 7 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
ICCBR
2003
Springer
14 years 26 days ago
Case Mining from Large Databases
Abstract. This paper presents an approach of case mining to automatically discover case bases from large datasets in order to improve both the speed and the quality of case based r...
Qiang Yang, Hong Cheng
HT
2010
ACM
14 years 22 days ago
Community-based ranking of the social web
The rise of social interactions on the Web requires developing new methods of information organization and discovery. To that end, we propose a generative community-based probabil...
Said Kashoob, James Caverlee, Krishna Kamath
IDA
2007
Springer
13 years 7 months ago
Removing biases in unsupervised learning of sequential patterns
Unsupervised sequence learning is important to many applications. A learner is presented with unlabeled sequential data, and must discover sequential patterns that characterize th...
Yoav Horman, Gal A. Kaminka
RCIS
2010
13 years 6 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu