[引用][C] Concept Data Analysis: Theory and Applications
C Carpineto - 2004 - books.google.com
With the advent of the Web along with the unprecedented amount of information available in
electronic format, conceptual data analysis is more useful and practical than ever, because …
electronic format, conceptual data analysis is more useful and practical than ever, because …
Formal context reduction in deriving concept hierarchies from corpora using adaptive evolutionary clustering algorithm star
It is beneficial to automate the process of deriving concept hierarchies from corpora since a
manual construction of concept hierarchies is typically a time-consuming and resource …
manual construction of concept hierarchies is typically a time-consuming and resource …
Concept lattices reduction: Definition, analysis and classification
SM Dias, NJ Vieira - Expert Systems with Applications, 2015 - Elsevier
Formal concept analysis (FCA) is currently considered an important formalism for knowledge
representation, extraction and analysis with applications in different areas. A problem …
representation, extraction and analysis with applications in different areas. A problem …
Variable-precision three-way concepts in L-contexts
The notion of fuzzy concept is proposed to deal with object-attribute data with L-values
(where L is a truth-value structure). One disadvantage of fuzzy concept is that a fuzzy context …
(where L is a truth-value structure). One disadvantage of fuzzy concept is that a fuzzy context …
A methodology for analysis of concept lattice reduction
SM Dias, NJ Vieira - Information Sciences, 2017 - Elsevier
Formal concept analysis (FCA) is a mathematical theory of data analysis with applications in
many areas. The problem of obtaining a concept lattice of an appropriate size was identified …
many areas. The problem of obtaining a concept lattice of an appropriate size was identified …
Alpha galois lattices: An overview
What we propose here is to reduce the size of Galois lattices still conserving their formal
structure and exhaustivity. For that purpose we use a preliminary partition of the instance set …
structure and exhaustivity. For that purpose we use a preliminary partition of the instance set …
IRAFCA: an O(n) information retrieval algorithm based on formal concept analysis
With the exponential increase in the quantity of information circulating on the Internet, an
evolution of information-retrieval systems becomes paramount. Indeed, current approaches …
evolution of information-retrieval systems becomes paramount. Indeed, current approaches …
Graph abstraction for closed pattern mining in attributed networks
H Soldano, G Santini - ECAI 2014, 2014 - ebooks.iospress.nl
We address the problem of finding patterns in an attributed graph. Our approach consists in
extending the standard methodology of frequent closed pattern mining to the case in which …
extending the standard methodology of frequent closed pattern mining to the case in which …
Hub-authority cores and attributed directed network mining
H Soldano, G Santini, D Bouthinon… - 2017 IEEE 29th …, 2017 - ieeexplore.ieee.org
We first define and experiment the hub-authority core (or HA-core) of a directed network. It
depends on two a and h parameters expressing requirements on hub and authority degrees …
depends on two a and h parameters expressing requirements on hub and authority degrees …
[PDF][PDF] A comprehensive overview on the foundations of formal concept analysis
K Sumangali, CA Kumar - Knowledge Management & E …, 2017 - pdfs.semanticscholar.org
The immersion of voluminous collection of data is inevitable almost everywhere. The
invention of mathematical models to analyse the patterns and trends of the data is an …
invention of mathematical models to analyse the patterns and trends of the data is an …