Results 221 to 230 of about 53,870 (265)
Some of the next articles are maybe not open access.
Conceptual and Practical Aspects of the aiNet Family of Algorithms
International Journal of Natural Computing Research, 2010In this paper, a review of the conceptual and practical aspects of the aiNet (Artificial Immune Network) family of algorithms will be provided. This family of algorithms started with the aiNet algorithm, proposed in 2002 for data clustering and, since then, several variations have been developed for data clustering, biclustering and optimization in ...
Fabrício Olivetti de França +3 more
openaire +1 more source
A conceptual version of the K-means algorithm
Pattern Recognition Letters, 1995Clustering techniques are important for knowledge acquisition. Traditionally, numerical clustering methods have been viewed in opposition to conceptual clustering methods developed in Artificial Intelligence. Numerical techniques emphasize the determination of homogeneous clusters but provide low-level descriptions of clusters. A conceptual approach is
openaire +1 more source
Conceptual graph matching: a flexible algorithm and experiments
Journal of Experimental & Theoretical Artificial Intelligence, 1992Abstract Graph matching is recognized as a central problem across a variety of application areas, and application-specific matchers have been developed with different simplifying assumptions to reduce the computational complexity. Graph matching is viewed as a form of plausible reasoning when conceptual information contained in graphs are considered ...
Sung H. Myaeng, Aurelio López-López
openaire +1 more source
A conceptual clustering algorithm for database schema design
IEEE Transactions on Knowledge and Data Engineering, 1994Conceptual clustering techniques based on current theories of categorization provide a way to design database schemas that more accurately represent classes. An approach is presented in which classes are treated as complex clusters of concepts rather than as simple predicates.
Howard W. Beck +2 more
openaire +1 more source
Algorithmic Consistency in Computational Inelasticity – a Conceptual Completion
PAMM, 2013AbstractThis paper communicates a new algorithmic concept, how higher‐order Runge‐Kutta (RK) methods for time integration of viscoelastic constitutive laws can be introduced into nonlinear finite element methods in order (i) to obtain the full nominal order p in time integration, (ii) to ensure that global equilibrium is only required at the end of ...
Eidel, Bernhard +2 more
openaire +1 more source
Conceptual Overview of Algorithms
2019The conceptual developments of x-ray dose calculation algorithms followed an evolutionary progression that mirrors what led to a deeper understanding of visible light. For higher megavoltage energies, photon scattering was less prevalent but electron ranges were longer and could disrupt equilibrium inside the body.
openaire +1 more source
Characterization and algorithmic recognition of canonical conceptual graphs
1993This paper studies canonical graphs, which are conceptual graphs derivable from a canonical basis. We provide several characterizations of canonical graphs and prove that the correspondence between notions of a projection and a derivation sequence (specialization) holds true for canonical graphs.
Marie-Laure Mugnier, Michel Chein
openaire +1 more source
CGMA: A novel conceptual graph matching algorithm
1993A novel Conceptual Graph Matching Algorithm (CGMA) is proposed along with a knowledge base organization scheme. It allows the user to select the Degree of Matching and Degree of Inheritance to increase the user's satisfaction. A conceptual graph is represented in a special linear form (called U-Form) for CGMA.
Gi-Chul Yang +2 more
openaire +1 more source
Conceptualizing Algorithmic Stigmatization
Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems, 2023Nazanin Andalibi +5 more
openaire +1 more source
Conceptual graphs isomorphism: Algorithm and use
1996The isomorphism problem is neither known to be NP-complete nor polynomial. Yet it is crucial for managing large conceptual graph sets. In order to speed up the conceptual graph isomorphism test, we associate to graphs a textual code that is invariant under isomorphism: a structural or filtering code. The structural code of a given graph is based on the
openaire +1 more source