Sciweavers

2593 search results - page 275 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
CGF
2011
14 years 10 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 7 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
JPDC
2008
134views more  JPDC 2008»
15 years 7 months ago
Middleware for data mining applications on clusters and grids
This paper gives an overview of two middleware systems that have been developed over the last 6 years to address the challenges involved in developing parallel and distributed imp...
Leonid Glimcher, Ruoming Jin, Gagan Agrawal
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 7 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 7 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...