Sciweavers

179 search results - page 32 / 36
» Scalable Process Discovery with Guarantees
Sort
View
RECOMB
2008
Springer
15 years 10 months ago
Sorting Cancer Karyotypes by Elementary Operations
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
Michal Ozery-Flato, Ron Shamir
RECOMB
2006
Springer
15 years 10 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
102
Voted
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
15 years 10 months ago
Cleaning disguised missing data: a heuristic approach
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
15 years 1 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
DMIN
2008
190views Data Mining» more  DMIN 2008»
14 years 11 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich