Sciweavers

7123 search results - page 226 / 1425
» The Ordered Set of Rough Sets
Sort
View
AI
2008
Springer
15 years 6 months ago
On the notion of concept I
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
Michael Freund
ICMLA
2004
15 years 8 months ago
RAIN: data clustering using randomized interactions between data points
Abstract-- This paper introduces a generalization of the Gravitational Clustering Algorithm proposed by Gomez et all in [1]. First, it is extended in such a way that not only the G...
Jonatan Gómez, Olfa Nasraoui, Elizabeth Leo...
SAC
2005
ACM
16 years 4 days ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
CP
2009
Springer
16 years 7 months ago
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
Meinolf Sellmann
IPPS
2000
IEEE
15 years 11 months ago
Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks
In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice partial ordered set ...
Andreas C. Döring, Gunther Lustig