Sciweavers

2512 search results - page 225 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 5 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
154
Voted
SDM
2012
SIAM
355views Data Mining» more  SDM 2012»
13 years 7 months ago
Granger Causality Analysis in Irregular Time Series
Learning temporal causal structures between time series is one of the key tools for analyzing time series data. In many real-world applications, we are confronted with Irregular T...
Mohammad Taha Bahadori, Yan Liu
124
Voted
ICASSP
2010
IEEE
15 years 4 months ago
Fast semi-supervised image segmentation by novelty selection
The goal of semi-supervised image segmentation is to obtain the segmentation from a partially labeled image. By utilizing the image manifold structure in labeled and unlabeled pix...
António R. C. Paiva, Tolga Tasdizen
EDUTAINMENT
2007
Springer
15 years 8 months ago
View-Dependent Hierarchical Foliage Simplification
High compression of plant geometry is an important aspect in fast realistic visualization of plants. Hierarchical structuring plant morphology is a key factor for real time plant r...
Qingqiong Deng, Xiaopeng Zhang, Marc Jaeger
IPPS
2007
IEEE
15 years 10 months ago
Optimizing Sorting with Machine Learning Algorithms
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
Xiaoming Li, María Jesús Garzar&aacu...