Sciweavers

1215 search results - page 116 / 243
» Numbers in Multi-relational Data Mining
Sort
View
141
Voted
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 10 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
SAC
2005
ACM
15 years 10 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
EFDBS
2001
15 years 6 months ago
Extensible Grouping and Aggregation for Data Reconciliation
New applications from the areas of analytical data processing and data integration require powerful features to condense and reconcile available data. Object-relational and other d...
Eike Schallehn, Kai-Uwe Sattler, Gunter Saake
KAIS
2010
144views more  KAIS 2010»
15 years 3 months ago
Boosting support vector machines for imbalanced data sets
Real world data mining applications must address the issue of learning from imbalanced data sets. The problem occurs when the number of instances in one class greatly outnumbers t...
Benjamin X. Wang, Nathalie Japkowicz
SIGKDD
2002
81views more  SIGKDD 2002»
15 years 4 months ago
P-tree Classification of Yeast Gene Deletion Data
Genomics data has many properties that make it different from "typical" relational data. The presence of multi-valued attributes as well as the large number of null valu...
Amal Perera, Anne Denton, Pratap Kotala, William J...