On the public citation graph

Mathematical aspects of concept analysis

0 signed · 105 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-6381-1_6openalex-snapshot
Conceptual Scaling
inferredcites →https://doi.org/10.1007/978-3-0348-7633-9openalex-snapshot
General Lattice Theory
inferredcites →https://doi.org/10.1007/978-3-642-01815-2_23openalex-snapshot
RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
inferredcites →https://doi.org/10.1007/978-3-642-38317-5_1openalex-snapshot
Contextual Implications between Attributes and Some Representation Properties for Finite Lattices
inferredcites →https://doi.org/10.1007/978-3-642-75040-3_17openalex-snapshot
Geometric Representation of Concept Lattices
inferredcites →https://doi.org/10.1007/978-3-642-76307-6openalex-snapshot
Classification, Data Analysis, and Knowledge Organization
inferredcites →https://doi.org/10.1007/978-3-642-76307-6_18openalex-snapshot
Data Analysis Based on a Conceptual File
inferredcites →https://doi.org/10.1007/978-3-642-76307-6_21openalex-snapshot
A Mathematical Model for Conceptual Knowledge Systems
inferredcites →https://doi.org/10.1007/978-3-662-12405-5openalex-snapshot
Machine Learning
inferredcites →https://doi.org/10.1007/978-3-662-12405-5_11openalex-snapshot
Learning from Observation: Conceptual Clustering
inferredcites →https://doi.org/10.1007/978-94-009-2639-4_2openalex-snapshot
Lattices in Data Analysis: How to Draw Them with a Computer
inferredcites →https://doi.org/10.1007/978-94-009-7798-3_15openalex-snapshot
Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts
inferredcites →https://doi.org/10.1007/bf00337926openalex-snapshot
Tensorial decomposition of concept lattices
inferredcites →https://doi.org/10.1007/bf00370198openalex-snapshot
On axiomatization of many-valued logics associated with formalization of plausible reasonings
inferredcites →https://doi.org/10.1007/bf01099201openalex-snapshot
Plausible inferences and plausible reasoning
inferredcites →https://doi.org/10.1007/bf01194537openalex-snapshot
Subdirect decomposition of concept lattices
inferredcites →https://doi.org/10.1007/bf01900297openalex-snapshot
Zur Kennzeichnung der Dedekind-MacNeilleschen HÜlle einer geordneten HÜlle
inferredcites →https://doi.org/10.1007/bf02020254openalex-snapshot
Über ein Problem von K. Zarankiewicz
inferredcites →https://doi.org/10.1016/0004-3702(91)90005-5openalex-snapshot
The computational complexity of abduction
inferredcites →https://doi.org/10.1016/0012-365x(87)90019-7openalex-snapshot
Subdirect product construction of concept lattices
inferredcites →https://doi.org/10.1016/0012-365x(91)90017-vopenalex-snapshot
The skeletons of free distributive lattices
inferredcites →https://doi.org/10.1016/0097-3165(75)90007-2openalex-snapshot
A problem of Zarankiewicz
inferredcites →https://doi.org/10.1016/0097-3165(81)90008-xopenalex-snapshot
A new result on the problem of Zarankiewicz
inferredcites →https://doi.org/10.1016/0167-9473(85)90008-8openalex-snapshot
Classification as a tool of research
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(79)90045-8openalex-snapshot
Complexity in mechanized hypothesis formation
inferredcites →https://doi.org/10.1016/0377-2217(89)90016-7openalex-snapshot
Classification and related methods of data analysis
inferredcites →https://doi.org/10.1016/0898-1221(92)90120-7openalex-snapshot
Concept lattices and conceptual knowledge systems
inferredcites →https://doi.org/10.1016/s0020-7373(81)80015-6openalex-snapshot
Complexity of hypothesis formation problems
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1145/321832.321834openalex-snapshot
The Diclique Representation and Decomposition of Binary Relations
inferredcites →https://doi.org/10.1515/crll.1969.239-240.333openalex-snapshot
Subdirekte Produkte und konjunkte Summen.
inferredcites →https://doi.org/10.21136/cpm.1989.108709openalex-snapshot
Boolean concept lattices and good contexts
inferredcites →https://doi.org/10.3233/fi-1991-14404openalex-snapshot
Algebraic Theory of Independence in Information Systems
inferredcites →https://doi.org/10.4064/ap-3-1-165-168openalex-snapshot
Teilweise Lösung eines verallgemeinerten Problems von K. Zarankiewicz
inferredcites →https://doi.org/10.4064/cm-11-1-81-84openalex-snapshot
On a combinatorical problem of K. Zarankiewicz
inferredcites →https://doi.org/10.4064/cm-13-2-255-258openalex-snapshot
Two improvements of a result concerning a problem of K. Zarankiewicz
inferredcites →https://doi.org/10.4064/cm-3-1-50-57openalex-snapshot
On a problem of K. Zarankiewicz
inferredcites →https://doi.org/10.4064/cm-6-1-61-65openalex-snapshot
On a combinatorical problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/mma.3814openalex-snapshot
Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis
inferred← citeshttps://doi.org/10.1002/widm.1088openalex-snapshot
Knowledge representation and processing with formal concept analysis
inferred← citeshttps://doi.org/10.1007/10722280_24openalex-snapshot
Formalizing Hypotheses with Concepts
inferred← citeshttps://doi.org/10.1007/10722280_33openalex-snapshot
Computing with Conceptual Structures
inferred← citeshttps://doi.org/10.1007/11528784_11openalex-snapshot
Galois Connections in Data Analysis: Contributions from the Soviet Era and Modern Russian Research
inferred← citeshttps://doi.org/10.1007/978-3-030-00617-4_5openalex-snapshot
Machine Learning Based on Similarity Operation
inferred← citeshttps://doi.org/10.1007/978-3-030-57855-8_5openalex-snapshot
Some Programming Optimizations for Computing Formal Concepts
inferred← citeshttps://doi.org/10.1007/978-3-030-57855-8_7openalex-snapshot
Interpretable Concept-Based Classification with Shapley Values
inferred← citeshttps://doi.org/10.1007/978-3-030-71214-3_16openalex-snapshot
Object-Attribute Biclustering for Elimination of Missing Genotypes in Ischemic Stroke Genome-Wide Data
inferred← citeshttps://doi.org/10.1007/978-3-030-72610-2_3openalex-snapshot
On Interpretability and Similarity in Concept-Based Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-77867-5_5openalex-snapshot
A New Kind of Implication to Reason with Unknown Information
inferred← citeshttps://doi.org/10.1007/978-3-031-62687-6_7openalex-snapshot
Syntactic Concept Lattice Models for Infinitary Action Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-08389-6_5openalex-snapshot
A Partial-Closure Canonicity Test to Increase the Efficiency of CbO-Type Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-12580-0_1openalex-snapshot
Characterization of Database Dependencies with FCA and Pattern Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-12580-0_25openalex-snapshot
VKF-Method of Hypotheses Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-25485-2_3openalex-snapshot
Introduction to Formal Concept Analysis and Its Applications in Information Retrieval and Related Fields
inferred← citeshttps://doi.org/10.1007/978-3-319-25783-9_12openalex-snapshot
Preclusivity and Simple Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-59271-8_4openalex-snapshot
Making Use of Empty Intersections to Improve the Performance of CbO-Type Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-60438-1_64openalex-snapshot
On Neural Network Architecture Based on Concept Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-36973-5_69openalex-snapshot
Near-Duplicate Detection for Online-Shops Owners: An FCA-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-38317-5_17openalex-snapshot
Fitting Pattern Structures to Knowledge Discovery in Big Data
inferred← citeshttps://doi.org/10.1007/978-3-642-40769-7_11openalex-snapshot
Using Formal Concept Analysis to Detect and Monitor Organised Crime
inferred← citeshttps://doi.org/10.1007/978-3-642-41299-8_11openalex-snapshot
A Formal Concept Analysis Based Approach to Minimal Value Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-45062-4_3openalex-snapshot
Scalable Knowledge Discovery in Complex Data with Pattern Structures
inferred← citeshttps://doi.org/10.1007/s10472-007-9053-6openalex-snapshot
On stability of a formal concept
inferred← citeshttps://doi.org/10.1007/s10472-022-09817-yopenalex-snapshot
On Shapley value interpretability in concept-based learning with formal concept analysis
inferred← citeshttps://doi.org/10.1007/s13042-022-01547-1openalex-snapshot
Computing formal concepts in parallel via a workload rebalance approach
inferred← citeshttps://doi.org/10.1007/s13042-022-01576-wopenalex-snapshot
Concept learning consistency under three-way decision paradigm
inferred← citeshttps://doi.org/10.1007/s13042-023-01949-9openalex-snapshot
A Top-K formal concepts-based algorithm for mining positive and negative correlation biclusters of DNA microarray data
inferred← citeshttps://doi.org/10.1016/j.dam.2019.11.006openalex-snapshot
Contribution to attributive and object subcontexts in inferring good maximally redundant tests
inferred← citeshttps://doi.org/10.1016/j.engappai.2020.104147openalex-snapshot
Scalability achievements for enumerative biclustering with online partitioning: Case studies involving mixed-attribute datasets
inferred← citeshttps://doi.org/10.1016/j.ijar.2017.01.009openalex-snapshot
Three-way concept learning based on cognitive operators: An information fusion viewpoint
inferred← citeshttps://doi.org/10.1016/j.ijar.2025.109573openalex-snapshot
The properties of 3-valued formal contexts in a cognitive viewpoint
inferred← citeshttps://doi.org/10.1016/j.ins.2014.10.011openalex-snapshot
A ‘Best-of-Breed’ approach for designing a fast algorithm for computing fixpoints of Galois Connections
inferred← citeshttps://doi.org/10.1016/j.ins.2019.05.009openalex-snapshot
Concurrent concept-cognitive learning model for classification
inferred← citeshttps://doi.org/10.1016/j.ins.2021.12.008openalex-snapshot
A new parallel algorithm for computing formal concepts based on two parallel stages
inferred← citeshttps://doi.org/10.1016/j.ins.2023.03.015openalex-snapshot
Simplification logic for the management of unknown information
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120284openalex-snapshot
Tri-level conflict analysis from the angle of three-valued concept analysis
inferred← citeshttps://doi.org/10.1016/j.ins.2024.121243openalex-snapshot
Single sample-oriented attribute reduction for rule learning with formal concept analysis
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.06.001openalex-snapshot
Decision implication canonical basis: a logical perspective
inferred← citeshttps://doi.org/10.1016/j.knosys.2014.08.020openalex-snapshot
Rule-preserved object compression in formal decision contexts using concept lattices
inferred← citeshttps://doi.org/10.1016/j.procs.2014.05.345openalex-snapshot
Concept Learning from Triadic Data
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.005openalex-snapshot
Dualization in lattices given by ordered sets of irreducibles
inferred← citeshttps://doi.org/10.1016/j.websem.2020.100624openalex-snapshot
On revealing shared conceptualization among open datasets
inferred← citeshttps://doi.org/10.1023/a:1012435612567openalex-snapshot
Machine Learning on the Basis of Formal Concept Analysis
inferred← citeshttps://doi.org/10.1080/03081079.2013.798899openalex-snapshot
Can triconcepts become triclusters?
inferred← citeshttps://doi.org/10.1088/1742-6596/1015/3/032068openalex-snapshot
Comparison of rule induction, decision trees and formal concept analysis approaches for classification
inferred← citeshttps://doi.org/10.1093/logcom/exaf078openalex-snapshot
On syntactic concept lattice models for the Lambek calculus and infinitary action logic
inferred← citeshttps://doi.org/10.1109/intellisys.2015.7361258openalex-snapshot
Context-dependent incremental learning of good maximally redundant tests
inferred← citeshttps://doi.org/10.1109/itnt57377.2023.10139273openalex-snapshot
On the Logical Classification of Integer Data
inferred← citeshttps://doi.org/10.1109/tcbb.2015.2443805openalex-snapshot
Using Formal Concept Analysis to Identify Negative Correlations in Gene Expression Data
inferred← citeshttps://doi.org/10.1109/wi-iat.2014.136openalex-snapshot
Learning Hypotheses from Triadic Labeled Data
inferred← citeshttps://doi.org/10.1134/s0005117924030056openalex-snapshot
Plausible Reasoning in an Algorithm for Generation of Good Classification Tests
inferred← citeshttps://doi.org/10.1155/2014/917639openalex-snapshot
On the Calculation of Formal Concept Stability
inferred← citeshttps://doi.org/10.17516/1997-1397-2017-10-3-372-384openalex-snapshot
On Algebraic Approach of R. Wille and B. Ganter in the Investigation of Texts
inferred← citeshttps://doi.org/10.21203/rs.3.rs-643920/v1openalex-snapshot
Rule Reductions of Decision Formal Context Based on Mixed Information
inferred← citeshttps://doi.org/10.22190/fuacr201225002bopenalex-snapshot
GENERATING KNOWLEDGE STRUCTURES FROM OPEN DATASETS' TAGS - AN APPROACH BASED ON FORMAL CONCEPT ANALYSIS
inferred← citeshttps://doi.org/10.3103/s0147688218050040openalex-snapshot
Relationships and Operations in a Sign-Based World Model of the Actor
inferred← citeshttps://doi.org/10.31857/s0005117924030075openalex-snapshot
Plausible Reasoning in an Algorithm for Generation of Good Classification Tests
inferred← citeshttps://doi.org/10.31857/s0005231024030066openalex-snapshot
Plausible Reasoning in an Algorithm for Generation of Good Classification Tests
inferred← citeshttps://doi.org/10.3233/978-1-61499-421-3-71openalex-snapshot
On Evaluating Interestingness Measures for Closed Itemsets
inferred← citeshttps://doi.org/10.47749/t/unicamp.2016.972731openalex-snapshot
Enumerating all maximal biclusters in numerical datasets
inferred← citeshttps://doi.org/10.48550/arxiv.1710.03289openalex-snapshot
Efficient mining of maximal biclusters in mixed-attribute datasets
inferred← citeshttps://doi.org/10.48550/arxiv.1810.07725openalex-snapshot
RIn-Close_CVC2: an even more efficient enumerative algorithm for biclustering of numerical datasets
inferred← citeshttps://doi.org/10.48550/arxiv.2003.04726openalex-snapshot
New advances in enumerative biclustering algorithms with online partitioning
inferred← citeshttps://doi.org/10.70675/148c5200zc441z43c1z9b85z7bb2f5ddc335openalex-snapshot
Algorithms on closure systems and their representations
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.