Sciweavers

10 search results - page 2 / 2
» Mining for Strong Negative Associations in a Large Database ...
Sort
View
BMCBI
2007
167views more  BMCBI 2007»
13 years 5 months ago
Applying negative rule mining to improve genome annotation
Background: Unsupervised annotation of proteins by software pipelines suffers from very high error rates. Spurious functional assignments are usually caused by unwarranted homolog...
Irena I. Artamonova, Goar Frishman, Dmitrij Frishm...
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
13 years 11 months ago
MINI: Mining Informative Non-redundant Itemsets
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
Arianna Gallo, Tijl De Bie, Nello Cristianini
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
13 years 3 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
14 years 5 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
ESANN
2004
13 years 6 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk