Sciweavers

7289 search results - page 225 / 1458
» A Dependent Set Theory
Sort
View
ADVIS
2004
Springer
14 years 1 months ago
Multiple Sets of Rules for Text Categorization
An important issue in text mining is how to make use of multiple pieces knowledge discovered to improve future decisions. In this paper, we propose a new approach to combining mult...
Yaxin Bi, Terry J. Anderson, Sally I. McClean
SLOGICA
2008
116views more  SLOGICA 2008»
13 years 8 months ago
Rough Sets and 3-Valued Logics
In the paper we explore the idea of describing Pawlak's rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f -- to...
Arnon Avron, Beata Konikowska
DM
2008
77views more  DM 2008»
13 years 7 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 3 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
COMPGEOM
2009
ACM
14 years 2 months ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray