Sciweavers

4085 search results - page 562 / 817
» Benchmarking Data Mining Algorithms
Sort
View
SAC
2005
ACM
16 years 19 days ago
The container loading problem
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...
Andrew Lim, Xingwen Zhang
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
16 years 18 days ago
Applying both positive and negative selection to supervised learning for anomaly detection
This paper presents a novel approach of applying both positive selection and negative selection to supervised learning for anomaly detection. It first learns the patterns of the n...
Xiaoshu Hang, Honghua Dai
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
16 years 7 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
BMCBI
2010
160views more  BMCBI 2010»
15 years 7 months ago
Annotation of gene promoters by integrative data-mining of ChIP-seq Pol-II enrichment data
Background: Use of alternative gene promoters that drive widespread cell-type, tissue-type or developmental gene regulation in mammalian genomes is a common phenomenon. Chromatin ...
Ravi Gupta, Priyankara Wikramasinghe, Anirban Bhat...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales