Sciweavers

16404 search results - page 781 / 3281
» A set coverage problem
Sort
View
ADBIS
1998
Springer
118views Database» more  ADBIS 1998»
15 years 11 months ago
Itemset Materializing for Fast Mining of Association Rules
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
Marek Wojciechowski, Maciej Zakrzewicz
FOCI
2007
IEEE
15 years 11 months ago
Conflict Analysis Based on Discernibility and Indiscernibility
Abstract-- The dual notions of discernibility and indiscernibility play an important role in intelligent data analysis. While discernibility focuses on the differences, the indisce...
Yiyu Yao, Yan Zhao
EMNLP
2008
15 years 9 months ago
A comparison of Bayesian estimators for unsupervised Hidden Markov Model POS taggers
There is growing interest in applying Bayesian techniques to NLP problems. There are a number of different estimators for Bayesian models, and it is useful to know what kinds of t...
Jianfeng Gao, Mark Johnson
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 7 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 11 months ago
Convex Hull of Imprecise Points in o(n \log{n}) Time after Preprocessing
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
Esther Ezra, Wolfgang Mulzer