Scispace (Formerly Typeset)
  1. Home
  2. Conferences
  3. Computational Intelligence and Data Mining
  4. 2000
  1. Home
  2. Conferences
  3. Computational Intelligence and Data Mining
  4. 2000
Showing papers presented at "Computational Intelligence and Data Mining in 2000"
Book Chapter•10.1007/978-3-7091-2588-5_3•
Possibilistic Graphical Models

[...]

Christian Borgelt1, Jörg Gebhardt, Rudolf Kruse1•
Otto-von-Guericke University Magdeburg1
1 Jan 2000
TL;DR: An overview on the state of the art of possibilistic networks w.r.t. to propagation and learning algorithms is provided.
Abstract: Graphical modeling is an important method to efficiently represent and analyze uncertain information in knowledge-based systems. Its most prominent representatives are Bayesian networks and Markov networks for probabilistic reasoning. which have been well-known for over ten years now. However, they suffer from certain deficiencies, if imprecise information has to be taken into account. Therefore possibilistic graphical modeling has recently emerged as a promising new area of research. Possibilistic networks are a noteworthy alternative to probabilistic networks whenever it is necessary to model both uncertainty and imprecision. Imprecision, understood as set-valued data, has often to be considered in situations in which information is obtained from human observers or imprecise measuring instruments. In this paper we provide an overview on the state of the art of possibilistic networks w.r.t. to propagation and learning algorithms.

87 citations

Book Chapter•10.1007/978-3-7091-2588-5_1•
Data Mining and Statistics

[...]

Arno Siebes
1 Jan 2000
TL;DR: Moore’s law has never been so obvious as it is now and the need for such resources is growing just as fast if not faster.
Abstract: Moore’s law has never been so obvious as it is now. New PC’s are equiped with hundreds of Megabytes of main memory, many Gigabytes of secondary storage and processors approaching a Gigaherz clockspeed. Fortunately1 the need for such resources is growing just as fast if not faster.

26 citations

Book Chapter•10.1007/978-3-7091-2588-5_5•
On the Solution of Fuzzy Equation Systems

[...]

Hans-Joachim Lenz1, Roland M. Müller1•
Free University of Berlin1
1 Jan 2000
TL;DR: A set of mixed linear and non-linear equations, which arise typically in operative controlling, is considered, which is modelled as a fuzzy set with a given membership function, in order to allow for imprecision.
Abstract: We consider a set of mixed linear and non-linear equations, which arise typically in operative controlling. The variables in the single equations are connected by arithmetic operations. In order to allow for imprecision, each variable is modelled as a fuzzy set with a given membership function. Given a vector of observed variables and an equation system with terms built up by fuzzy sets, a controlling decision is to be made, whether the data set is ‘consistent’ with the equation system or not.

5 citations

Book Chapter•10.1007/978-3-7091-2588-5_6•
Learning Fuzzy Models and Potential Outliers

[...]

Michael R. Berthold1•
University of California, Berkeley1
1 Jan 2000
TL;DR: This paper describes an approach that tries to build an interpretable model while still maintaining all the information in the data, achieved through a two stage process that builds an outlier-model for data points of low relevance and generates a simpler model that may point out potential areas of interest to the user.
Abstract: Outliers or distorted attributes very often severely interfere with data analysis algorithms that try to extract few meaningful rules. Most methods to deal with outliers try to completely ignore them. This can be potentially harmful since the very outlier that was ignored might have described a rare but still extremely interesting phenomena. In this paper we describe an approach that tries to build an interpretable model while still maintaining all the information in the data. This is achieved through a two stage process. A first phase builds an outlier-model for data points of low relevance, followed by a second stage which uses this model as filter and generates a simpler model, describing only examples with higher relevance, thus representing a more general concept. The outlier-model on the other hand may point out potential areas of interest to the user. Preliminary experiments indicate that the two models in fact have lower complexity and sometimes even offer superior performance.

4 citations

Book Chapter•10.1007/978-3-7091-2588-5_7•
An Algorithm for Adaptive Clustering and Visualisation of Highdimensional Data Sets

[...]

Friedhelm Schwenker1, Hans A. Kestler1, Günther Palm1•
University of Ulm1
1 Jan 2000
TL;DR: An algorithm for exploratory data analysis which combines adaptive c-means clustering and multi-dimensional scaling (ACMDS) and may be considered as an alternative approach to Kohonen’s self organizing feature map (SOM).
Abstract: We describe an algorithm for exploratory data analysis which combines adaptive c-means clustering and multi-dimensional scaling (ACMDS). ACMDS is an algorithm for the online visualization of clustering processes and may be considered as an alternative approach to Kohonen’s self organizing feature map (SOM). Whereas SOM is a heuristic neural network algorithm, ACMDS is derived from multivariate statistical algorithms. The implications of ACMDS are illustrated through five different data sets.

3 citations

Book Chapter•10.1007/978-3-7091-2588-5_4•
An Overview of Possibilistic Logic and its Application to Nonmonotonic Reasoning and Data Fusion

[...]

Salem Benferhat1, Didier Dubois1, Henri Prade1•
Paul Sabatier University1
1 Jan 2000
TL;DR: This paper provides the syntactic counterparts of different ways of aggregating possibility distributions, well-known at the semantic level, and presents a general approach for fusing several ordered belief bases provided by different sources according to various modes.
Abstract: This paper provides a brief survey of possibilistic logic as a simple and efficient tool for handling nonmonotonic reasoning and data fusion. In nonmonotonic reasoning, Lehmann’s preferential System P is known to provide reasonable but very cautious conclusions, and in particular, preferential inference is blocked by the presence of “irrelevant” properties. When using Lehmann’s rational closure, the inference machinery, which is then more productive, may still remain too cautious. These two types of inference can be represented using a possibility theory-based semantics. The paper proposes several safe ways to overcome the cautiousness of these systems. One of these ways takes advantage of (contextual) independence assumptions of the form: the fact that δ is true (or is false) does not affect the validity of the rule “normally if α then β”. The modelling of such independence assumptions is discussed in the possibilistic framework. This paper presents a general approach for fusing several ordered belief bases provided by different sources according to various modes. More precisely, the paper provides the syntactic counterparts of different ways of aggregating possibility distributions, well-known at the semantic level.

3 citations

Book Chapter•10.1007/978-3-7091-2588-5_9•
Controlling Based on Stochastic Models.

[...]

Hans-Joachim Lenz1, Egmar Rödel2•
Free University of Berlin1, Humboldt University of Berlin2
1 Jan 2000
TL;DR: Operative Controlling is used in industry and commerce in order to find out whether there exist avoidable irregularities in a given data set or not.
Abstract: Operative Controlling is used in industry and commerce in order to find out whether there exist avoidable irregularities in a given data set or not. These irregularities may be caused by environment, management, and unhonest or erroneous actions of any kind. Controlling is model based in the sense that prior knowledge about facts and structural relationships between variables is used to build up a model of a firm. Its relations are based on definitions, institutional and behavioural equations.

2 citations

Book Chapter•10.1007/978-3-7091-2588-5_8•
Learning in Computer Soccer

[...]

Hans-Dieter Burkhard1•
Humboldt University of Berlin1
1 Jan 2000
TL;DR: Computer Soccer is a testbed for intelligent autonomous machines and programs under real life conditions and provides challenging problems in the design of intelligent agents and in the field of machine learning.
Abstract: Computer Soccer is a testbed for intelligent autonomous machines and programs under real life conditions. Besides others, it provides challenging problems in the design of intelligent agents and in the field of machine learning.

Tools

SciSpace AgentBiomedical AgentSciSpace RecruitSciSpace for EnterpriseAgent GalleryChat with PDFLiterature ReviewAI WriterFind TopicsParaphraserCitation GeneratorExtract DataAI DetectorCitation Booster

Learn

ResourcesLive Workshops

SciSpace

CareersSupportBrowse PapersPricingSciSpace Affiliate ProgramCancellation & Refund PolicyTermsPrivacyData Sources

Directories

PapersTopicsJournalsAuthorsConferencesInstitutionsCitation StylesWriting templates

Extension & Apps

SciSpace Chrome ExtensionSciSpace Mobile App

Contact

support@scispace.com
SciSpace

© 2026 | PubGenius Inc. | Suite # 217 691 S Milpitas Blvd Milpitas CA 95035, USA

soc2
Secured by Delve