1923 search results - page 129 / 385 » Weighted Decision Trees |
157
click to vote
ECCV
1998
Springer
16 years 8 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
191
click to vote
ROCAI
2004
Springer
15 years 11 months ago
2004
Springer
We present an empirical comparison of the AUC performance of seven supervised learning methods: SVMs, neural nets, decision trees, k-nearest neighbor, bagged trees, boosted trees,...
176
click to vote
HICSS
2008
IEEE
15 years 6 months ago
2008
IEEE
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
179
click to vote
CORIA
2007
15 years 7 months ago
2007
In this paper, we propose a fuzzy model to querying the XML documents, by taking into account not only the document contents, but also their structure. The concept of minimal size ...
189
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...