Sciweavers

1413 search results - page 162 / 283
» Efficient Learning of Semi-structured Data from Queries
Sort
View
DAWAK
2005
Springer
15 years 10 months ago
A Decremental Algorithm for Maintaining Frequent Itemsets in Dynamic Databases
Data mining and machine learning must confront the problem of pattern maintenance because data updating is a fundamental operation in data management. Most existing data-mining alg...
Shichao Zhang, Xindong Wu, Jilian Zhang, Chengqi Z...
CVPR
2004
IEEE
16 years 6 months ago
Feature Selection for Classifying High-Dimensional Numerical Data
Classifying high-dimensional numerical data is a very challenging problem. In high dimensional feature spaces, the performance of supervised learning methods suffer from the curse...
Yimin Wu, Aidong Zhang
JMLR
2008
148views more  JMLR 2008»
15 years 4 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
LREC
2010
154views Education» more  LREC 2010»
15 years 5 months ago
CCASH: A Web Application Framework for Efficient, Distributed Language Resource Development
We introduce CCASH (Cost-Conscious Annotation Supervised by Humans), an extensible web application framework for cost-efficient annotation. CCASH provides a framework in which cos...
Paul Felt, Owen Merkling, Marc Carmen, Eric K. Rin...
IFIP12
2008
15 years 5 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda