Sciweavers

917 search results - page 12 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
GD
1994
Springer
13 years 11 months ago
A Geometrical Heuristic for Drawing Concept Lattices
Abstract. Concept lattices are used in formal concept analysis to represent data conceptually so that the original data are still recognizable. Their line diagrams should re ect th...
Gerd Stumme, Rudolf Wille
ILP
2005
Springer
14 years 1 months ago
Spatial Clustering of Structured Objects
Clustering is a fundamental task in Spatial Data Mining where data consists of observations for a site (e.g. areal units) descriptive of one or more (spatial) primary units, possib...
Donato Malerba, Annalisa Appice, Antonio Varlaro, ...
CISST
2003
83views Hardware» more  CISST 2003»
13 years 9 months ago
Computational Efficiency of Structural Image Matching
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
Richard Chase, Boris Kovalerchuk
ICCS
2007
Springer
13 years 11 months ago
A Comparison of Different Conceptual Structures Projection Algorithms
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
Heather D. Pfeiffer, Roger T. Hartley
CLA
2007
13 years 9 months ago
Representing Numeric Values in Concept Lattices
Formal Concept Analysis is based on the occurrence of symbolic attributes in individual objects, or observations. But, when the attribute is numeric, treatment has been awkward. In...
John L. Pfaltz