820 search results - page 25 / 164 » Finding low-utility data structures |
KDD
2005
ACM
14 years 9 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
ESANN
2004
13 years 10 months ago
2004
Abstract. The use of self-organizing maps to analyze data often depends on finding effective methods to visualize the SOM's structure. In this paper we propose a new way to pe...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
PRICAI
1998
Springer
14 years 26 days ago
1998
Springer
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...
CPM
1999
Springer
14 years 28 days ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...