Sciweavers

7123 search results - page 123 / 1425
» The Ordered Set of Rough Sets
Sort
View
ICDM
2002
IEEE
93views Data Mining» more  ICDM 2002»
14 years 3 months ago
Learning from Order Examples
We advocate a new learning task that deals with orders of items, and we call this the Learning from Order Examples (LOE) task. The aim of the task is to acquire the rule that is u...
Toshihiro Kamishima, Shotaro Akaho
WG
1992
Springer
14 years 2 months ago
On the Complexity of Partial Order Properties
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
Stefan Felsner, Dorothea Wagner
JUCS
2007
84views more  JUCS 2007»
13 years 10 months ago
Deriving Consensus for Hierarchical Incomplete Ordered Partitions and Coverings
: A method for determining consensus of hierarchical incomplete ordered partitions and coverings of sets is presented in this chapter. Incomplete ordered partitions and coverings a...
Marcin Hernes, Ngoc Thanh Nguyen
DATE
2005
IEEE
126views Hardware» more  DATE 2005»
14 years 3 months ago
The Accidental Detection Index as a Fault Ordering Heuristic for Full-Scan Circuits
We investigate a new fault ordering heuristic for test generation in full-scan circuits. The heuristic is referred to as the accidental detection index. It associates a value ADI ...
Irith Pomeranz, Sudhakar M. Reddy
ILP
2004
Springer
14 years 3 months ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...