Sciweavers

359 search results - page 44 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
PRL
2008
135views more  PRL 2008»
13 years 10 months ago
A hierarchical clustering algorithm based on the Hungarian method
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
Jacob Goldberger, Tamir Tassa
GIS
2011
ACM
13 years 1 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira
SIGGRAPH
1993
ACM
14 years 2 months ago
Mesh optimization
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same to...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
14 years 1 months ago
Direct mining of discriminative patterns for classifying uncertain data
Classification is one of the most essential tasks in data mining. Unlike other methods, associative classification tries to find all the frequent patterns existing in the input...
Chuancong Gao, Jianyong Wang
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
14 years 10 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...