Abstract is missing.
- Towards Generic Pattern MiningMohammed Javeed Zaki, Nagender Parimi, Nilanjana De, Feng Gao, Benjarath Phoophakdee, Joe Urban, Vineet Chaoji, Mohammad Al Hasan, Saeed Salem. 1-20 [doi]
- Conceptual Exploration of Semantic MirrorsUta Priss, L. John Old. 21-32 [doi]
- Towards a Formal Concept Analysis Approach to Exploring Communities on the World Wide WebJayson E. Rome, Robert M. Haralick. 33-48 [doi]
- Automatic Selection of Noun Phrases as Document Descriptors in an FCA-Based Information Retrieval SystemJuan M. Cigarrán, Anselmo Peñas, Julio Gonzalo, Felisa Verdejo. 49-63 [doi]
- Combining Spatial and Lattice-Based Information LandscapesJon Ducrou, Peter W. Eklund. 64-78 [doi]
- Explaining the Structure of FrameNet with Concept LatticesFrancisco J. Valverde-Albacete. 79-94 [doi]
- Lessons Learned in Applying Formal Concept Analysis to Reverse EngineeringGabriela Arévalo, Stéphane Ducasse, Oscar Nierstrasz. 95-112 [doi]
- Navigation Spaces for the Conceptual Analysis of Software StructureRichard Cole, Peter Becker 0002. 113-128 [doi]
- Restructuring Help Systems Using Formal Concept AnalysisPeter W. Eklund, Bastian Wormuth. 129-144 [doi]
- An Application of FCA to the Analysis of Aeronautical IncidentsNicolas Maille, Irving C. Statler, Laurent Chaudron. 145-161 [doi]
- Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept AnalysisJaume Baixeries, José L. Balcázar. 162-175 [doi]
- Formal Concept Analysis Constrained by Attribute-Dependency FormulasRadim Belohlávek, Vladimir Sklenar. 176-191 [doi]
- On Computing the Minimal Generator Family for Concept Lattices and IcebergsKamal Nehmé, Petko Valtchev, Mohamed Rouane Hacene, Robert Godin. 192-207 [doi]
- Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept LatticeAnne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad. 208-222 [doi]
- A Generic Algorithm for Generating Closed Sets of a Binary RelationAlain Gély. 223-234 [doi]
- Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne BasesAlain Gély, Raoul Medina, Lhouari Nourine, Yoan Renaud. 235-248 [doi]
- A Parallel Algorithm for Lattice ConstructionJean François Djoufak Kengue, Petko Valtchev, Clémentin Tayou Djamégni. 249-264 [doi]
- Using Intermediate Representation Systems to Interact with Concept LatticesPeter Becker 0002. 265-268 [doi]
- Crisply Generated Fuzzy ConceptsRadim Belohlávek, Vladimir Sklenar, Jiri Zacpal. 269-284 [doi]
- Triadic Concept Graphs and Their Conceptual ContentsLars Schoolmann. 285-298 [doi]
- Alpha Galois Lattices: An OverviewVéronique Ventos, Henry Soldano. 299-314 [doi]
- A Finite State Model for On-Line Analytical Processing in Triadic ContextsGerd Stumme. 315-328 [doi]
- Complete Subalgebras of Semiconcept Algebras and Protoconcept AlgebrasBjörn Vormbrock. 329-343 [doi]
- Coherence Networks of Concept Lattices: The Basic TheoremSascha Karl Dörflein, Rudolf Wille. 344-359 [doi]
- Turing Machine Representation in Temporal Concept AnalysisKarl Erich Wolff, Wendsomde Yameogo. 360-374 [doi]
- Protoconceptual Contents and ImplicationsJoachim Hereth Correia, Julia Klinger. 375-390 [doi]
- Planarity of LatticesChristian Zschalig. 391-402 [doi]
- Bialgebraic Contexts for Distributive Lattices - RevisitedJürg Schmid. 403-407 [doi]
- Which Concept Lattices Are Pseudocomplemented?Bernhard Ganter, Léonard Kwuida. 408-416 [doi]