Sciweavers

666 search results - page 2 / 134
» Using Concept Lattices to Support Service Selection
Sort
View
CLA
2007
13 years 6 months ago
Inducing Decision Trees via Concept Lattices
The paper presents a new method of decision tree induction based on formal concept analysis (FCA). The decision tree is derived using a concept lattice, i.e. a hierarchy of cluster...
Radim Belohlávek, Bernard De Baets, Jan Out...
CLA
2007
13 years 6 months ago
Precalculating Component Interface Compatibility using FCA
In component-based software engineering, software systems are built by assembling prefabricated reusable components. The compatibility between the assembled components is crucial. ...
Gabriela Arévalo, Nicolas Desnos, Marianne ...
ACL
2010
13 years 2 months ago
A Generalized-Zero-Preserving Method for Compact Encoding of Concept Lattices
Constructing an encoding of a concept lattice using short bit vectors allows for efficient computation of join operations on the lattice. Join is the central operation any unifica...
Matthew Skala, Victoria Krakovna, János Kra...
COST
1994
Springer
127views Multimedia» more  COST 1994»
13 years 9 months ago
Support for High-Performance Multipoint Multimedia Services
Existing and upcoming distributed multimedia applications require highly diverse services to satisfy their communication needs. Service integrated communication systems should be c...
Georg Carle, Jochen H. Schiller, Claudia Schmidt
DAWAK
2010
Springer
13 years 6 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar