International Journal of Man-Machine Studies
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
CEM - A Conceptual Email Manager
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
A Logical Generalization of Formal Concept Analysis
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Learning of Simple Conceptual Graphs from Positive and Negative Examples
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
A Framework for Developing Embeddable Customized Logics
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Introduction to logical information systems
Information Processing and Management: an International Journal
Efficient Browsing and Update of Complex Data Based on the Decomposition of Contexts
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Hi-index | 0.00 |
Strings are an important part of most real application multivalued contexts. Their conceptual treatment requires the definition of substring scales, i.e., sets of relevant substrings, so as to form informative concepts. However these scales are either defined by hand, or derived in a context-unaware manner (e.g., all words occuring in string values). We present an efficient algorithm based on suffix trees that produces complete and concise substring scales. Completeness ensures that every possible concept is formed, like when considering the scale of all substrings. Conciseness ensures the number of scale attributes (substrings) is less than the cumulated size of all string values. This algorithm is integrated in Camelis, and illustrated on the set of all ICCS paper titles.