Sciweavers

532 search results - page 66 / 107
» Think globally, search locally
Sort
View
DAGSTUHL
2004
14 years 5 days ago
Knowledge-Based Sampling for Subgroup Discovery
Subgroup discovery aims at finding interesting subsets of a classified example set that deviates from the overall distribution. The search is guided by a so-called utility function...
Martin Scholz
IDA
2009
Springer
13 years 8 months ago
Trajectory Voting and Classification Based on Spatiotemporal Similarity in Moving Object Databases
We propose a method for trajectory classification based on trajectory voting in Moving Object Databases (MOD). Trajectory voting is performed based on local trajectory similarity. ...
Costas Panagiotakis, Nikos Pelekis, Ioannis Kopana...
COMSIS
2010
13 years 8 months ago
3D point pattern matching based on spatial geometric flexibility
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises...
Xiaopeng Wei, Xiaoyong Fang, Qiang Zhang, Dongshen...
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
14 years 3 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo
JMLR
2010
143views more  JMLR 2010»
13 years 9 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...