Sciweavers

57 search results - page 4 / 12
» Faster algorithms for guided tree edit distance
Sort
View
91
Voted
DEXAW
2006
IEEE
111views Database» more  DEXAW 2006»
15 years 3 months ago
Finding Syntactic Similarities Between XML Documents
Detecting structural similarities between XML documents has been the subject of several recent work, and the proposed algorithms mostly use tree edit distance between the correspo...
Davood Rafiei, Daniel L. Moise, Dabo Sun
82
Voted
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
14 years 11 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
EUROGP
2005
Springer
107views Optimization» more  EUROGP 2005»
15 years 3 months ago
Operator-Based Distance for Genetic Programming: Subtree Crossover Distance
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
Steven M. Gustafson, Leonardo Vanneschi
69
Voted
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
14 years 9 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
ECAI
2000
Springer
15 years 1 months ago
Data Set Editing by Ordered Projection
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
Jesús S. Aguilar-Ruiz, José Crist&oa...