2638 search results - page 459 / 528 » Random Geometric Complexes |
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...
MCS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
GD
1995
Springer
13 years 11 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
CICLING
2010
Springer
13 years 11 months ago
2010
Springer
We present a new ensemble method that uses Entropy Guided Transformation Learning (ETL) as the base learner. The proposed approach, ETL Committee, combines the main ideas of Baggin...