Sciweavers

5463 search results - page 337 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
16 years 6 days ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
ACL
1998
15 years 8 months ago
Trainable, Scalable Summarization Using Robust NLP and Machine Learning
We describe a trainable and scalable summarization system which utilizes features derived from information retrieval, information extraction, and NLP techniques and on-line resour...
Chinatsu Aone, Mary Ellen Okurowski, James Gorlins...
COLT
1995
Springer
15 years 10 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 11 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
RSCTC
2004
Springer
134views Fuzzy Logic» more  RSCTC 2004»
15 years 12 months ago
Rough Set Methods in Approximation of Hierarchical Concepts
Abstract. Many learning methods ignore domain knowledge in synthesis of concept approximation. We propose to use hierarchical schemes for learning approximations of complex concept...
Jan G. Bazan, Sinh Hoa Nguyen, Hung Son Nguyen, An...