Sciweavers

587 search results - page 19 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
14 years 4 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
NMR
2004
Springer
14 years 25 days ago
A SAT-based polynomial space algorithm for answer set programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
13 years 11 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim
LREC
2010
187views Education» more  LREC 2010»
13 years 9 months ago
A Large List of Confusion Sets for Spellchecking Assessed Against a Corpus of Real-word Errors
One of the methods that has been proposed for dealing with real-word errors (errors that occur when a correctly spelled word is substituted for the one intended) is the "conf...
Jennifer Pedler, Roger Mitton
AAAI
2004
13 years 9 months ago
SAT-Based Answer Set Programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea