32545 search results - page 455 / 6509 » Data Structures and Algorithms |
180
click to vote
FLAIRS
2000
15 years 8 months ago
2000
Hierarchical conceptual clustering has been proven to be a useful data mining technique. Graph-based representation of structural information has been shown to be successful in kn...
232
click to vote
SPIRE
1999
Springer
15 years 11 months ago
1999
Springer
In this paper, we propose an innovative approach to extracting semi-structured data from Web sources. The idea is to collect a couple of example objects from the user and to use t...
226
click to vote
IJHPCA
2007
15 years 7 months ago
2007
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
160
click to vote
ICDM
2002
IEEE
15 years 12 months ago
2002
IEEE
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
179
click to vote
WADS
1989
Springer
15 years 11 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...