The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Desachy, Pattern recognition of strong graphs based on possibilistic c-means and k-formulae matching (180- 189); Leila Zerrouki, Bernadette Bouchon-Meunier and Rémy Fondacci, A fuzzy-neural model for co-ordination ... Chang and C. K. ...
In this paper, we propose the utilisation of extended fuzzy rules for the more flexible description of knowledge, and the consideration of uncertainty and lack of confidence in the process of feature extraction ... The two are combined using a flexible possibilistic rule evaluation structure, leading to more robust overall operation. ... not one matching the observed face • Bel = 0, Pl = 1 which occurs when y = 1, y c = 0 and implies absolute ignorance. ...doi:10.1504/ijista.2006.009916 fatcat:lrioj5ctpze23nlcerrlkii3ma
A model is defined that predicts an agent's ascriptions of causality (and related notions of facilitation and justification) between two events in a chain, based on background knowledge about the normal ... Tentative properties of causality ascriptions are discussed, and the conditions under which they hold are identified (preference for abnormal factors, transitivity, coherence with logical entailment, and ... alternative or a competitor to models based on structural equations, like the one of Halpern and Pearl. ...doi:10.1016/j.ijar.2007.07.003 fatcat:dg23l6x7lnha5cgdtkixhjriva
The expressiveness of propositional non-clausal (NC) formulas is exponentially richer than that of clausal formulas. Yet, clausal efficiency outperforms non-clausal one. ... To overcome such weakness, we define the hybrid class ℍ_ℕℂ of Horn Non-Clausal (Horn-NC) formulas, by adequately lifting the Horn pattern to NC form, and argue that ℍ_ℕℂ, along with future Horn-NC algorithms ... The authors in  develop another polynomial SAT class U C K based on the class Unitrefutation Complete, U C  , and prove a major result, concretely that SLU R K = U C K . • Various results [ ...arXiv:2108.13744v3 fatcat:5vpb3cmqxbgs7hviclkovvltqq
In order to provide a needed up-to-date review of recent developments in PCSS, this article summarizes existing studies on this topic. ... Firstly, we outline the acquisition and evolution of the 3D point cloud from the perspective of remote sensing and computer vision, as well as the published benchmarks for PCSS studies. ... The GHT is based on: ρ = x cos(θ) + y sin(θ) Err(d; M ))} Fig. 2 . 2 RANSAC family with algorithms categorized according to their performance and basic strategies C -Means (FCM) algorithm and Possibilistic ...arXiv:1908.08854v2 fatcat:kwpsogl4gbd3nji4xpcx32c4ta
The impact of different extraction methods on the accuracy of image classifiers will be studied. ... One important issue here is to find reasonable groupings even for non-connected and widespread objects. ... Reduced Delaunay graph (RDG)  represents a graphbased approach and is based on partitioning the Delaunay graph of a given data set. ...doi:10.1007/s00138-009-0205-z fatcat:lznlsygjmvgrbkss3lan6mrhui
Strong interests in the small-sample problem have been given towards for establishing several information diffusion techniques for pattern recognition. ... To promote the development of this area, in this paper we suggest two open topics: the anti-accuracy principle and the digital image compression technique based on the fuzzy if-then rules extracted by ... This paper is supported by the research grant No.49971001 of National Natural Science Foundation of China and Foundation for University Key Teacher by the Ministry of Education of China. ...doi:10.1142/s0219622002000142 fatcat:ojg72df7ljc6xp6pkyqwi6ndpa
Then, we focus on the theories and evolution of homomorphic encryption, as well as the applications of the basic operations and application-specific tasks. ... Finally, we discuss the security and performance of existing works and give future directions in this field. ...  employed the BGV cryptosystem to design a privacy-preserving weighted possibilistic c-means algorithm. ...doi:10.1109/access.2019.2949782 fatcat:ternbyhqezgd5cvhtfqfggqdqq
This contrast the main limitation of the adoption of knowledge-based measures, namely their strong dependence on the availability of an ontology  . ... Differently from metadata-based similarity, content-based similarity admits inputs composed of a mixture of texts and formulae. In fact, a MLM can contain words, phrases, and formulae. ...doi:10.1109/compsac.2018.00176 dblp:conf/compsac/MarchisioCFR18 fatcat:2ojtlfz45ngktkri7zoncgjhge
version of vector quantization, c-means clustering, and bootstrap editing. ... Generalization error rates of the 11 methods are estimated on two synthetic and two real data sets. ... Because it is intuitive, simple, and often, pretty accurate. 1 Human pattern recognition is almost always based on comparison of the presented input to a catalog of stored examples, both typical and ...doi:10.1002/int.1068 fatcat:3s53bi5sgjdvlpn57x5jlmfnuq
of natural language, pattern recognition and best-match information retrieval, several kinds of probabilistic reasoning, planning and problem solving, unsupervised learning, and a range of concepts in ... This "SP theory", which has been under development since 1987, provides a unified view of such things as the workings of a universal Turing machine, the nature of 'knowledge', the interpretation and production ... Recognition means matching stored patterns with new information and unification of patterns which are the same. ...arXiv:cs/0401009v1 fatcat:nivyq52ytbft3nudcmyuj2scgy
Pattern recognition of strong graphs based on possibilistic c-means and k-formulae matching. (English summary) (sce 2000h:68016) Wu, Geng Shi see Tian, Yuan et al. ... Isomorphism between strong fuzzy relational graphs based on k-formulae. (English summary) 2000k:68136 — (with Desachy, J.) ...
In this paper we review some of the most important ones, i.e., Bayesian theory of probability, Dempster-Shafer theory of evidence, and fuzzy set theory, describe how they work and in what ways they differ ... from one another, and show their strength and weakness respectively as well as their connection. ... Acknowledgements This work forms part of the projects supported by the UK Engineering and Physical Sciences Research Council (EPSRC) under Grant References GR/R30624 and GR/R32413. ...doi:10.1080/09617353.2002.11690751 fatcat:2dx7qpb2yng3vd3fzhq44dl7da
Advances in Intelligent Systems and Computing
As in previous years, BNAIC 2016 welcomed four types of contributions, namely A) regular papers, B) compressed contributions, C) demonstration abstracts, and D) thesis abstracts. ... discussion on Social Robots, with contributions by Elly Konijn (Vrije ... This work successfully builds on previous theories from the field of new media and linguistics. ...doi:10.1007/978-3-319-28518-4_28 fatcat:uwxvq6txmrba3ajulmblafgh2a
Inspired by nature, intelligent algorithm has always been one of the research hotspots. ... After that, related concepts, main contents and research progresses of quantum optimization and quantum learning are introduced respectively. ... On this basis, Fu uses K-Means to optimize the modularity density. ...doi:10.1109/access.2020.2970105 fatcat:y765erlnyzakvdj3nv273ccgei
« Previous Showing results 1 — 15 out of 79 results