419 search results - page 27 / 84 » Using Matrix Decompositions in Formal Concept Analysis |
COOPIS
2004
IEEE
13 years 11 months ago
2004
IEEE
An innate characteristic of the development of ontologies is that they are often created by independent groups of expertise, which generates the necessity of merging and aligning o...
CLA
2007
13 years 9 months ago
2007
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...
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
Optical systems are becoming increasingly important as they tend to resolve many bottlenecks in the present age communications and electronics. Some common examples include their u...
EOR
2006
13 years 7 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
CLA
2004
13 years 9 months ago
2004
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...