Filters








113,471 Hits in 7.8 sec

Characterizing approximate-matching dependencies in formal concept analysis with pattern structures

Jaume Baixeries, Victor Codocedo, Mehdi Kaytoue, Amedeo Napoli
2018 Discrete Applied Mathematics  
Our new results state that, starting from the conceptual structure of a pattern structure, and generalizing the notion of relation between tuples, approximate-matching dependencies can be characterized  ...  We show that these dependencies can be formalized in the framework of Formal Concept Analysis (FCA) using a previous formalization introduced for standard FDs.  ...  In Section 5 we propose a generic characterization and computation of approximate-matching dependencies in terms of Pattern Structures.  ... 
doi:10.1016/j.dam.2018.03.073 fatcat:zomtrupnfrghlfg44s6zcaz4q4

Characterizing functional dependencies in formal concept analysis with pattern structures

Jaume Baixeries, Mehdi Kaytoue, Amedeo Napoli
2014 Annals of Mathematics and Artificial Intelligence  
Whereas it has been deeply investigated in those fields, strong links exist with the mathematical framework of Formal Concept Analysis.  ...  Here, we present an alternative avoiding such a data representation and show how to characterize functional dependencies using the formalism of pattern structures, an extension of classical FCA to handle  ...  Basics on functional dependencies are presented in Section 2. Formal Concept Analysis and its usage to characterize functional dependencies is described in Section 3.  ... 
doi:10.1007/s10472-014-9400-3 fatcat:ckesjrsxe5fc5cvek5x35zondy

When social computing meets soft computing: opportunities and insights

Fei Hao, Doo-Soon Park, Zheng Pei
2018 Human-Centric Computing and Information Sciences  
In order to better cope with these burning issues, advances on soft computing technologies, such as fuzzy set, formal concept analysis and rough set theories, probabilistic computing, as well as neural  ...  This paper aims to survey various SNA approaches using soft computing techniques such as fuzzy logic, formal concept analysis, rough sets theory and soft set theory.  ...  network representation, reputation/position analysis of users, social relationships characterization, topological structure analysis, social data analysis.  ... 
doi:10.1186/s13673-018-0131-z fatcat:wpndgifehneazfevku6vuewzf4

Page 3646 of Mathematical Reviews Vol. , Issue 80I [page]

1980 Mathematical Reviews  
The instantiation of the scheme variables is realized by a new method which uses pattern matching and then, if necessary, generalization and further pattern matching.  ...  One can compute the number of examples necessary to characterize in a unique way a function of this class.”  ... 

A Proposition for Combining Pattern Structures and Relational Concept Analysis [chapter]

Víctor Codocedo, Amedeo Napoli
2014 Lecture Notes in Computer Science  
In a nutshell, this adaptation allows the scenario where RCA needs to be applied in a relational context family composed by pattern structures instead of formal contexts.  ...  In this paper we propose an adaptation of the RCA process enabling the relational scaling of pattern structures.  ...  Introduction Relational Concept Analysis (RCA) [10] is an extension of Formal Concept Analysis (FCA) [4] based on a scaling process.  ... 
doi:10.1007/978-3-319-07248-7_8 fatcat:odhqsbn6hna7hoobutulwuhwle

Patterns of Clinical Trial Eligibility Criteria [chapter]

Krystyna Milian, Annette ten Teije, Anca Bucur, Frank van Harmelen
2012 Lecture Notes in Computer Science  
In this study we addressed the problem of formalizing eligibility criteria.  ...  We expect that extending the presented method for pattern recognition with recognition of ontology concepts will facilitate generating computable queries and automated reasoning for various applications  ...  We would like to thank Rinke Hoekstra and Kathrin Dentler for the help with reviewing.  ... 
doi:10.1007/978-3-642-27697-2_11 fatcat:m53azorw3nhnvefl2pih6klu2m

Towards a Generic Framework for Trustworthy Program Refactoring

Dániel Horpácsi, Judit Kőszegi, Dávid J. Németh
2021 Acta Cybernetica  
Apparently, it is always challenging to relate executable refactoring implementations with the formal semantics of the transformed language.  ...  Refactoring has to preserve the dynamics of the transformed program with respect to a particular definition of semantics and behavioral equivalence.  ...  In the former case, more high-level concepts can be added to the dependency analysis; in the latter, more refactorings can be considered during the generalization.  ... 
doi:10.14232/actacyb.284349 fatcat:mv2yhsfmijddhca6ps3fcr3shm

Semantic Sparse Representation of Disease Patterns

Artur Przelaskowski
2010 International Journal of Electronics and Telecommunications  
Semantic Sparse Representation of Disease Patterns Sparse data representation is discussed in a context of useful fundamentals led to semantic content description and extraction of information.  ...  Proposed methodology of sparse disease patterns considers accuracy of sparse representation to estimate target content for detailed analysis.  ...  Moreover, it does not require a close match between the sampling pattern and characteristic image structures giving sparse structure essence estimates.  ... 
doi:10.2478/v10177-010-0036-x fatcat:dapoiuzztvhpddpntjbxro327a

LESTER: using paradigm cases in a Quasi-Precedential legal domain

K. A. Lambert, M. H. Grunewald
1989 Proceedings of the second international conference on Artificial intelligence and law - ICAIL '89  
Formally, the process is viewed as a purely internal dispute resolution mechanism unique to the parties who structured iu A proper conception of the arbitrator's function is basic.  ...  Typically, in domains in which there are a limited number of formal decisions and in which there is a well-defined hierarchy of decisionmakers, the concept of precedent-bound decisionmaking exists in a  ... 
doi:10.1145/74014.74027 dblp:conf/icail/LambertG89 fatcat:wdygoo442fctbjvmnkidfqbfvq

Gradient pattern analysis of structural dynamics: application to molecular system relaxation

Reinaldo R. Rosa, Marcia R. Campos, Fernando M. Ramos, Nandamudi L. Vijaykumar, Susumu Fujiwara, Tetsuya Sato
2003 Brazilian journal of physics  
The GPA technique is applied for the first time in 3D-simulated molecular chains with the objective of characterizing small symmetry breaking, amplitude and phase disorder due to spatio-temporal fluctuations  ...  This paper describes an innovative technique, the gradient pattern analysis (GPA), for analysing spatially extended dynamics.  ...  The gradient pattern analysis is still under detailed investigation in order to make more precise the concept of characterizing spatio-temporal disorder (nonlinear pattern equilibria, topological intermittency  ... 
doi:10.1590/s0103-97332003000300023 fatcat:iysemosf3za4fb56nbl32ytw2u

Classification Based Retrieval Using Formal Concept Analysis [chapter]

Belén Díaz-Agudo, Pedro A. González-Calero
2001 Lecture Notes in Computer Science  
This paper shows how the use of Formal Concept Analysis (FCA) can support CBR application designers, in the task of discovering knowledge embedded in a case base.  ...  FCA application provides an internal sight of the case base conceptual structure and allows finding regularity patterns among the cases.  ...  Structured domains are characterized by the fact that there is an intrinsic dependency between certain elements in the domain.  ... 
doi:10.1007/3-540-44593-5_13 fatcat:qfxpdak5njadfcnfimqpi4eg44

Using latent semantic analysis to improve access to textual information

S. T. Dumais, G. W. Furnas, T. K. Landauer, S. Deerwester, R. Harshman
1988 Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '88  
This is done by taking advantage of implicit higher-order structure in the association of terms with text objects.  ...  Most approaches to retrieving textual materials depend on a lexical match between words in users' requests and those in or assigned to database objects.  ...  DEFICIENCIES OF KEYWORD RETRIEVAL METHODS A standard approach to finding relevant textual material depends on matching individual words in users' requests with individual words in database texts.  ... 
doi:10.1145/57167.57214 fatcat:kg5j5upx4bhztdxgzec25kwpya

Graph-based Text Representation and Matching: A Review of the State of the Art and Future Challenges

Ahmed Hamza Osman, Omar Mohammed Barukub
2020 IEEE Access  
We provide a formal description of the problem of graph-based text representation and introduce some basic concepts.  ...  In addition, the graph matching taxonomy implements three main categories based on the matching approach, including structural-, semantic-, and similarity-based approaches.  ...  The authors, therefore, acknowledge with thanks DSR technical and financial support.  ... 
doi:10.1109/access.2020.2993191 fatcat:wkss6xzzcneujfe6ynnmbydhsa

Scalable Model for Extensional and Intensional Descriptions of Unclassified Data [chapter]

Hércules A. Prado, Stephen C. Hirtle, Paulo M. Engel
2000 Lecture Notes in Computer Science  
Knowledge discovery from unlabeled data comprises two main tasks: identification of "natural groups" and analysis of these groups in order to interpret their meaning.  ...  The architecture can be extended to other supervised/unsupervised learning algorithms that comply with the same desiderata.  ...  It can be observed that the number of clusters depends on the threshold and the distance metric used to compare the inputs with the clusters.  ... 
doi:10.1007/3-540-45591-4_53 fatcat:6gkzxslbbjhhno5yrdogpvd6oq

Automatic extraction of framework-specific models from framework-based application code

Michal Antkiewicz, Thiago Tonelli Bartolomei, Krzysztof Czarnecki
2007 Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering - ASE '07  
Framework-specific models represent the design of application code from the framework viewpoint by showing how framework-provided concepts are implemented in the code.  ...  In this paper, we describe an experimental study of the static analyses necessary to automatically retrieve such models from application code.  ...  Concept instances are characterized by configurations of features and the features correspond to structural and behavioral patterns in the completion code.  ... 
doi:10.1145/1321631.1321664 dblp:conf/kbse/AntkiewiczBC07 fatcat:qygupsholbfdbmsw6xu47lqphi
« Previous Showing results 1 — 15 out of 113,471 results