Concept Generalization
نویسندگان
چکیده
منابع مشابه
Data Mining with Concept Generalization Digraphs
Wanlin Pang, Robert J. Hilderman, Howard J. Hamilton, and Scott D. Goodwin Department of Computer Science University of Regina Regina, Saskatchewan, Canada, S4S 0A2 fpang,hilder,hamilton,[email protected] Abstract We present the Path-Based Generalization and Bias-Based Generalization algorithms for attribute-oriented induction using concept generalization digraphs. Concept generalization d...
متن کاملGeneralization of One-Sided Concept Lattices
We provide a generalization of one-sided (crisp-fuzzy) concept lattices, based on Galois connections. Our approach allows analysis of object-attribute models with different structures for truth values of attributes. Moreover, we prove that this method of creating one-sided concept lattices is the most general one, i.e., with respect to the set of admissible formal contexts, it produces all Galo...
متن کاملA Logical Generalization of Formal Concept Analysis
We propose a generalization of Formal Concept Analysis (FCA) in which sets of attributes are replaced by expressions of an almost arbitrary logic. We prove that all FCA can be reconstructed on this basis. We show that from any logic that is used in place of sets of attributes can be derived a contextualized logic that takes into account the formal context and that is isomorphic to the concept l...
متن کاملA generalization of the concept of Toeplitz graphs∗
A suitable generalization for both the concept of Cayley graphs and that of Toeplitz graphs is given in this note and a number of interesting open problems are proposed. A natural decomposition theorem is obtained for generalized Topelitz graphs and connected generalized Toeplitz graphs. These are new observations and their proofs are direct from the definition.
متن کاملA Model of Concept Generalization and Feature Representation in Hierarchies
We present a novel modeling framework for representing category exemplars and features. This approach treats each category exemplar as a probability distribution over a hierarchically structured graph. The model jointly learns the mixture of each exemplar across categories in the graph, and a feature representation for each node in the graph, including nodes for which no data is directly observ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Japanese Journal of Educational Psychology
سال: 2005
ISSN: 0021-5015
DOI: 10.5926/jjep1953.53.1_122