510 search results - page 52 / 102 » Complexity measures and decision tree complexity: a survey |
160
click to vote
ESANN
2008
15 years 7 months ago
2008
Abstract. In this paper, we present a new similarity measure for a clustering self-organizing map which will be reached using a new approach of hierarchical clustering. (1) The sim...
128
click to vote
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
140
click to vote
DOLAP
2004
ACM
15 years 11 months ago
2004
ACM
Nowadays, decision support systems are evolving in order to handle complex data. Some recent works have shown the interest of combining on-line analysis processing (OLAP) and data...
164
click to vote
HIPEAC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Designers of large parallel computers and clusters are becoming increasingly concerned with the cost and power consumption of the interconnection network. A simple way to...
177
click to vote
ICDM
2009
IEEE
16 years 23 days ago
2009
IEEE
—The real world is composed of sets of objects that move and morph in both space and time. Useful concepts can be defined in terms of the complex interactions between the multi-...