Formal Concept Analysis
10th International Conference, ICFCA 2012, Leuven, Belgium, May 7-10, 2012. Proceedings
Published on 25. June 2012
XII, 309 pages
978-3-642-29892-9 (ISBN)
Description
This book constitutes the refereed proceedings of the 10th International Conference on Formal Concept Analysis, ICFCA 2012, held in Leuven, Belgium in May 2012. The 20 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 68 submissions. The topics covered in this volume range from recent advances in machine learning and data mining; mining terrorist networks and revealing criminals; concept-based process mining; to scalability issues in FCA and rough sets.
More details
Other editions
Additional editions
Florent Domenach | Dmitry Ignatov | Jonas Poelmans
Formal Concept Analysis
10th International Conference, ICFCA 2012, Leuven, Belgium, May 7-10, 2012. Proceedings
Book
04/2012
Springer
€53.49
Shipment within 7-9 days
Content
- Title
- Preface
- Organization
- Table of Contents
- Invited Talks
- Dark Web: Exploring and Mining the Dark Side of theWeb
- Declarative Modeling for Machine Learning and Data Mining
- References
- Can Concepts Reveal Criminals?
- Cartification: From Similarities to Itemset Frequencies
- Processes Are Concepts, Aren't They?
- Rough Sets and FCA - Scalability Challenges
- References
- Regular Papers
- Approximating Concept Stability
- Introduction
- Main Definitions
- FCA
- Stability
- Approximation of the Number of Closed and Nonclosed Sets
- Computation of Stability
- Experimental Results
- Conclusion
- References
- Logical Analysis of Concept Lattices by Factorization
- Introduction
- Preliminaries
- Formal Concept Analysis
- Complete Tolerances and Block Relations
- Residuated Lattices
- Main Results
- Tolerance Residuated Lattice
- First-Order Fuzzy Logic for Factorizing Concept Lattices
- Illustrative Example
- Conclusion
- Future Work
- References
- Basic Level of Concepts in Formal Concept Analysis
- Introduction
- Motivation
- Paper Overview
- Related Work
- Preliminaries and Notation
- Basic Level of Concepts in the Psychology of Concepts
- An Approach to Basic Level in FCA
- Experiments
- Experiment 1
- Experiment 2
- Conclusions and Future Research
- References
- A Peep through the Looking Glass: Articulation Points in Lattices
- Introduction
- Preliminaries
- Relations, Concepts and Lattices
- Graphs
- Bipartite Graphs
- Co-bipartite Graphs
- Lattices and Co-bipartite Graphs
- Example
- Lattices with an Articulation Point
- Cases Where the Lattice Has an Articulation Point
- Expressing the Mirror Articulation Point
- Impact on the Co-bipartite Graph
- Artificially Creating an Articulation Point of the Lattice
- Finding the Articulation Points of a Lattice
- Computing a Maximal Chain of the Lattice
- Computing the Articulation Points from a Maximal Chain of the Lattice
- Finding the Clique Minimal Separator Decomposition of a Co-bipartite Graph
- Lattices Where Every Concept Is an Articulation Point
- Chain Lattices and the Corresponding Graphs
- Recognizing Chain Lattices and the Corresponding Graphs
- Creating a Chain Lattice and Corresponding Graph Embeddings
- Conclusion and Perspectives
- References
- Practical Use of Formal Concept Analysis in Service-Oriented Computing
- Introduction
- Challenges of Service Selection
- Theoretical Fundations: Formal Concept Analysis
- Global Approach
- Application to Services
- Service Registry
- Decision Structure
- Algorithms for Selection
- Reacting to Service Availability at Runtime
- Implementation and Validation
- Implementation
- Experimental Results
- Related Work
- Conclusion
- References
- Publication Analysis of the Formal Concept Analysis Community
- Introduction
- Related Work
- Dataset
- Gathering and Preprocessing
- Notations and Derived Data Structures
- Definitions and Methodology
- Results
- Conferences
- Authors
- Publications
- Future Work
- References
- References of the Analyzed Publications
- Understanding the Semantic Structure of Human fMRI Brain Recordings with Formal Concept Analysis
- Introduction
- Organization of Visual Processing in Humans and Previous Research
- Formal Concept Analysis
- fMRI Experiment
- Experimental Methods and Data Preprocessing
- Search Volumes and Voxel Selection
- Learning the Formal Context with a Hierarchical Bayesian Classifier
- Results
- Conclusion
- References
- Cubes of Concepts: Multi-dimensional Exploration of Multi-valued Contexts
- Introduction
- Preliminaries
- Multi-valued Contexts
- Value Domains and Attribute-Value Schemas
- Attribute Contexts and Feature Context
- Cubes of Formal Concepts as Navigation Places
- Representation and Interaction in Abilis
- Comparison with OLAP
- Related Work
- Conclusion
- References
- Ordinal Factor Analysis
- Introduction
- Conceptual Factorisation
- Ordinal Factors
- Conclusion
- References
- A Macroscopic Approach to FCA and Its Various Fuzzifications
- Introduction
- Biresiduation
- Biadditivity
- Abstract Concepts and Maximal Rectangles
- Macroscopics: Combining Biresiduation and Biadditivity
- Conclusion
- References
- A Connection between Clone Theory and FCA Provided by Duality Theory
- Introduction
- Preliminaries
- Category Theory
- Clones
- Hartung's Duality for Lattices
- Duality Theory for Clones
- Clones over Bounded Lattices
- A Small Illustration of the Duality
- Conclusion
- References
- Formal Concept Discovery in Semantic Web Data
- Introduction
- Related Work
- Semantic Web Data
- FCA Algorithms and Benchmarks
- FCA and the Semantic Web
- Towards a Concept Layer for the Semantic Web
- Applying FCA to Semantic Web Data
- Concept Computation Process Overview
- Extracting Contexts from the Semantic Web
- Computing Concepts
- Semantic Web Data Properties
- Experiments
- Web Data Extraction and Preparation
- FCA Algorithms: Ensuring Fairness
- FCA Algorithms Performance: Traditional vs. Web Data
- FCA Algorithms Performance: Web-Scale Data
- Conclusion
- References
- Concept Lattices of Incomplete Data
- Introduction
- Preliminaries
- Concept Lattices
- Boolean Algebras and Residuated Lattices
- L-sets and L-relations
- Boolean Algebras with Variables
- Incomplete Contexts
- Formal Concept Analysis in Fuzzy Setting
- Concept Lattices of Incomplete Contexts
- An Illustrative Example
- Experiments
- Conclusion and Future Research
- References
- Formal Concept Analysis as a Framework for Business Intelligence Technologies
- Introduction
- Preliminaries
- Formal Concept Analysis in Crisp and Fuzzy Settings
- Classical Measure WaKli:Gen and Aggregation Operators CKKM:AO
- On Line Analytical Processing (OLAP)
- Formal Concept Analysis with Measures
- Formal Concept Analysis with Measures - Theory
- FCA with Measures - Comprehensive Example
- Applications of Formal Concept Analysis with Measures
- Extent Values and Generalized OLAP Cube
- Constraints of Lattice with Values via Closure Operators
- FCA in Fuzzy Settings with Measures and Fuzzy OLAP
- Conclusion and Future Research
- References
- Good Classification Tests as Formal Concepts
- Introduction
- The Basic Terminology of Formal Concept Analysis
- Good Diagnostic Test Definition in Terms of FCA
- Good Diagnostic Tests and Inference FunctionalDependencies
- Conclusion
- References
- Modeling Preferences over Attribute Sets in Formal Concept Analysis
- Introduction
- Universal Preferences
- Existential Preferences
- Conclusion
- References
- Finding Top-N Colossal Patterns Based on Clique Search with Dynamic Update of Graph
- Introduction
- Preliminaries
- Pattern Graph
- Top-N Colossal Frequent Pattern Mining
- Finding Top-N Colossal Patterns with Pattern Graph
- Fundamental Idea
- More about Prunings of Useless Cliques
- Expanding Clique with Pruning Rules
- Algorithm for Finding Top-N Colossal Patterns
- Experimental Results
- Concluding Remarks
- References
- Quantitative Concept Analysis
- Introduction
- Proxets
- Definition, Intuition, Examples
- Derived Proxets and Notations
- Vectors, Limits, Adjunctions
- Upper and Lower Vectors
- Limits
- Completions
- Adjunctions
- Projectors and Nuclei
- Cones and Cuts
- Proximity Matrices and Their Decomposition
- Definitions, Connections
- Matrix Decomposition through Nucleus
- Universal Properties
- Representable Concepts and Their Proximities
- Decomposition without Completion
- Computing Proximities of Representable Concepts
- Discussion and Future Work
- References
- Some Notes on Managing Closure Operators
- Introduction
- Preliminaries
- Closure Operators
- Contexts
- Implications
- Size Comparisons
- Algorithms for Managing Closure Operators
- Finer or Coarser?
- Adding a Closed Set
- Adding an Implication
- Conversion of Representations
- Conclusion
- References
- Distributed Formal Concept Analysis Algorithms Based on an Iterative MapReduce Framework
- Introduction
- Related Work
- Contributions
- Formal Concept Analysis
- Ganter: Iterative Closure Mining Algorithm
- Distributed Algorithms for Formal Concept Mining
- MRGanter
- MRGanter+
- Twister MapReduce
- Evaluation
- Test Environment and Datasets
- Results and Analysis
- Conclusion
- References
- Author Index
