Sciweavers

1275 search results - page 4 / 255
» Chunking with Decision Trees
Sort
View
DOLAP
2007
ACM
13 years 11 months ago
Optimal chunking of large multidimensional arrays for data warehousing
ss domain. Using this more abstract approach means that more data sources of varying types can be incorporated with less effort, and such heterogeneous data sources might be very r...
Ekow J. Otoo, Doron Rotem, Sridhar Seshadri
SDM
2008
SIAM
197views Data Mining» more  SDM 2008»
13 years 9 months ago
A general framework for estimating similarity of datasets and decision trees: exploring semantic similarity of decision trees
Decision trees are among the most popular pattern types in data mining due to their intuitive representation. However, little attention has been given on the definition of measure...
Irene Ntoutsi, Alexandros Kalousis, Yannis Theodor...
CLIN
2000
13 years 9 months ago
Transforming a Chunker to a Parser
Ever since the landmark paper Ramshaw and Marcus (1995), machine learning systems have been used successfully for identifying base phrases (chunks), the bottom constituents of a p...
Erik F. Tjong Kim Sang
ACSC
2001
IEEE
13 years 11 months ago
Efficiency of Data Structures for Detecting Overlaps in Digital Documents
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
Krisztián Monostori, Arkady B. Zaslavsky, H...
IJCAI
1989
13 years 8 months ago
Generating Better Decision Trees
A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the arti...
Steven W. Norton