Sciweavers

22 search results - page 2 / 5
» Strongly Typed Inductive Concept Learning
Sort
View
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 5 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
ML
2000
ACM
157views Machine Learning» more  ML 2000»
13 years 5 months ago
A Multistrategy Approach to Classifier Learning from Time Series
We present an approach to inductive concept learning using multiple models for time series. Our objective is to improve the efficiency and accuracy of concept learning by decomposi...
William H. Hsu, Sylvian R. Ray, David C. Wilkins
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 5 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
SIGIR
2003
ACM
13 years 10 months ago
Text categorization by boosting automatically extracted concepts
Term-based representations of documents have found widespread use in information retrieval. However, one of the main shortcomings of such methods is that they largely disregard le...
Lijuan Cai, Thomas Hofmann
IIS
2003
13 years 6 months ago
The Development of the Inductive Database System VINLEN: A Review of Current Research
Current research on the VINLEN inductive database system is briefly reviewed and illustrated by selected results. The goal of research on VINLEN is to develop a methodology for de...
Kenneth A. Kaufman, Ryszard S. Michalski