Sciweavers

1798 search results - page 216 / 360
» A Tree for All Seasons
Sort
View
DMKD
1999
ACM
108views Data Mining» more  DMKD 1999»
14 years 1 months ago
Classification as Mining and Use of Labeled Itemsets
We investigate the relationship between association and classification mining. The main issue in association mining is the discovery of interesting patterns of the data, so called...
Dimitris Meretakis, Beat Wüthrich
BTW
1999
Springer
145views Database» more  BTW 1999»
14 years 1 months ago
A Multi-Tier Architecture for High-Performance Data Mining
Data mining has been recognised as an essential element of decision support, which has increasingly become a focus of the database industry. Like all computationally expensive data...
Ralf Rantzau, Holger Schwarz
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
14 years 1 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
14 years 1 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
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...
Strahil Ristov, Eric Laporte
HOA
1993
14 years 1 months ago
Strong Normalization of Typeable Rewrite Systems
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
Steffen van Bakel, Maribel Fernández