Data base applications in Visual Foxpro.
Data mining techniques using decision tree model in materialised projection and selection view.
With the availability of very large data storage today, redundant data structures are no longer a big issue. However, an intelligent way of managing materialised projection and selection views that can lead to fast access of data is the central issue dealt with in this paper. A set of implementation steps for the data warehouse administrators or decision makers to improve the response time of queries is also defined. The study concludes that both attributes and tuples, are important factors to be...
Data probes, vertical trajectories and classification: a tentative study
In this paper we introduce a method of classification based on data probes. Data points are considered as point masses in space and a probe is simply a particle that is launched into the space. As the probe passes by data clusters, its trajectory will be influenced by the point masses. We use this information to help us to find vertical trajectories. These are trajectories in the input space that are mapped onto the same value in the output space and correspond to the data classes.
Data-driven models for fault detection using kernel PCA: A water distribution system case study
Kernel Principal Component Analysis (KPCA), an example of machine learning, can be considered a non-linear extension of the PCA method. While various applications of KPCA are known, this paper explores the possibility to use it for building a data-driven model of a non-linear system-the water distribution system of the Chojnice town (Poland). This model is utilised for fault detection with the emphasis on water leakage detection. A systematic description of the system's framework is followed by...
Decision tree design by simulated annealing
Declarative and procedural semantics of fuzzy similarity based unification
In this paper we argue that for fuzzy unification we need a procedural and declarative semantics (as opposed to the two valued case, where declarative semantics is hidden in the requirement that unified terms are syntactically – letter by letter – identical). We present an extension of the syntactic model of unification to allow near matches, defined using a similarity relation. We work in Hájek’s fuzzy logic in narrow sense. We base our semantics on a formal model of fuzzy logic programming extended...
Decomposition of high dimensional pattern spaces for hierarchical classification
In this paper we present a novel approach to decomposing high dimensional spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical classification. This strategy of pre-processing the data and explicitly optimising the partitions for subsequent mapping onto a hierarchical classifier is found to both reduce the learning complexity and the classification time with no degradation in overall classification error rate. Results of partitioning pattern spaces...
Decomposition translations and syntax directed translation schemata
Deduction in many-valued logics: a survey.
Deduction over graphs under constraints : a soundness and completeness theorem
Default logic as a formalism for understanding commonsense reasoning.
Commonsense reasoning is the reasoning of agents interacting with the real world. Non monotonic reasoning is a well developed research area gathering the logical formalisms that treat commonsense reasoning. One of the best known of such formalisms is Default logic. In this paper we discuss Default logic at both the proof-theoretic and semantics levels and show that Default logic provides a clear and formal framework to understand the logical nature of commonsense reasoning.
Definition of First Order Language with Arbitrary Alphabet. Syntax of Terms, Atomic Formulas and their Subterms
Second of a series of articles laying down the bases for classical first order model theory. A language is defined basically as a tuple made of an integer-valued function (adicity), a symbol of equality and a symbol for the NOR logical connective. The only requests for this tuple to be a language is that the value of the adicity in = is -2 and that its preimage (i.e. the variables set) in 0 is infinite. Existential quantification will be rendered (see [11]) by mere prefixing a formula with a letter....
Degradation in probability logic: When more information leads to less precise conclusions
Probability logic studies the properties resulting from the probabilistic interpretation of logical argument forms. Typical examples are probabilistic Modus Ponens and Modus Tollens. Argument forms with two premises usually lead from precise probabilities of the premises to imprecise or interval probabilities of the conclusion. In the contribution, we study generalized inference forms having three or more premises. Recently, Gilio has shown that these generalized forms “degrade” – more premises...
Denoising Manifolds for Dimension
2000 Mathematics Subject Classification: 68T01, 62H30, 32C09.Locally Linear Embedding (LLE) has gained prominence as a tool in unsupervised non-linear dimensional reduction. While the algorithm aims to preserve certain proximity relations between the observed points, this may not always be desirable if the shape in higher dimensions that we are trying to capture is observed with noise. This note suggests that a desirable first step is to remove or at least reduce the noise in the observations before...
Density estimation with quadratic loss: a confidence intervals method
We propose a feature selection method for density estimation with quadratic loss. This method relies on the study of unidimensional approximation models and on the definition of confidence regions for the density thanks to these models. It is quite general and includes cases of interest like detection of relevant wavelets coefficients or selection of support vectors in SVM. In the general case, we prove that every selected feature actually improves the performance of the estimator. In the case...
Des explications pour reconnaître et exploiter les structures cachées d’un problème combinatoire
L’identification de structures propres à un problème est souvent une étape clef pour la conception d’heuristiques de recherche comme pour la compréhension de la complexité du problème. De nombreuses approches en Recherche Opérationnelle emploient des stratégies de relaxation ou de décomposition dès lors que certaines struc- tures idoines ont été identifiées. L’étape suivante est la conception d’algorithmes de résolution qui puissent intégrer à la volée, pendant la résolution, ce type d’information....
Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
L'identification de structures propres à un problème est souvent une étape clef pour la conception d'heuristiques de recherche comme pour la compréhension de la complexité du problème. De nombreuses approches en Recherche Opérationnelle emploient des stratégies de relaxation ou de décomposition dès lors que certaines struc- tures idoines ont été identifiées. L'étape suivante est la conception d'algorithmes de résolution qui puissent intégrer à la volée, pendant la résolution, ce type d'information....
Design of a neuro-sliding mode controller for interconnected quadrotor UAVs carrying a suspended payload
In this study, a generalized system model is derived for interconnected quadrotor UAVs carrying a suspended payload. Moreover, a novel neural network-based sliding mode controller (NSMC) for the system is suggested. While the proposed controller uses the advantages of the robust structure of sliding mode controller (SMC) for the nonlinear system, the neural network component eliminates the chattering effects in the control signals of the SMC and increases the efficiency of the SMC against time-varying...
Design of a novel control algorithm for a 6 D.O.F. mobile manipulator based on a robust observer
Design of a Participatory Decision Making Agent Architecture Based on Argumentation and Influence Function – Application to a Serious Game about Biodiversity Conservation
This paper addresses an ongoing experience in the design of an artificial agent taking decisions and combining them with the decisions taken by human agents. The context is a serious game research project, aimed at computer-based support for participatory management of protected areas (and more specifically national parks) in order to promote biodiversity conservation and social inclusion. Its objective is to help various stakeholders (e.g., environmentalist, tourism operator) to collectively understand...