Sciweavers

1717 search results - page 50 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
87
Voted
SAC
2006
ACM
15 years 6 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
116
Voted
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 1 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
90
Voted
NIPS
1998
15 years 1 months ago
A Polygonal Line Algorithm for Constructing Principal Curves
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
Balázs Kégl, Adam Krzyzak, Tam&aacut...
CORR
2012
Springer
209views Education» more  CORR 2012»
13 years 8 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii
93
Voted
EDM
2010
129views Data Mining» more  EDM 2010»
15 years 2 months ago
Skill Set Profile Clustering: The Empty K-Means Algorithm with Automatic Specification of Starting Cluster Centers
While students' skill set profiles can be estimated with formal cognitive diagnosis models [8], their computational complexity makes simpler proxy skill estimates attractive [...
Rebecca Nugent, Nema Dean, Elizabeth Ayers