Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 55 (1995), S. 225-276 
    ISSN: 1572-9338
    Keywords: Knowledge analysis ; symbolic data analysis ; metadata ; metaknowledge ; probability ; possibility ; evidence theory ; uncertainty logic
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The main aim of the symbolic approach in data analysis is to extend problems, methods and algorithms used on classical data to more complex data called “symbolic objects” which are well adapted to representing knowledge and which are “generic” unlike usual observations which characterize “individual things”. We introduce several kinds of symbolic objects: Boolean, possibilist, probabilist and belief. We briefly present some of their qualities and properties; three theorems show how Probability, Possibility and Evidence theories may be extended on these objects. Finally, four kinds of data analysis problems including the symbolic extension are illustrated by several algorithms which induce knowledge from classical data or from a set of symbolic objects.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 2 (1973), S. 61-88 
    ISSN: 1573-7640
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Given a finite setE ⊂R n, the problem is to find clusters (or subsets of “similar” points inE) and at the same time to find the most typical elements of this set. An original mathematical formulation is given to the problem. The proposed algorithm operates on groups of points, called “samplings” (“samplings” may be called “multiple centers” or “cores”); these “samplings” adapt and evolve into interesting clusters. Compared with other clustering algorithms, this algorithm requires less machine time and storage. We provide some propositions about nonprobabilistic convergence and a sufficient condition which ensures the decrease of the criterion. Some computational experiments are presented.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Journal für Praktische Chemie/Chemiker-Zeitung 58 (1853), S. 75-81 
    ISSN: 0021-8383
    Keywords: Chemistry ; Organic Chemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...