ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Artikel  (95)
  • Blackwell Publishing Ltd  (95)
  • American Geophysical Union
  • American Physical Society
  • International Union of Crystallography
  • 2005-2009
  • 1995-1999  (95)
  • 1980-1984
  • 1935-1939
  • 2007
  • 1995  (95)
  • 1982
  • Informatik  (95)
Sammlung
  • Artikel  (95)
Verlag/Herausgeber
Erscheinungszeitraum
  • 2005-2009
  • 1995-1999  (95)
  • 1980-1984
  • 1935-1939
Jahr
  • 1
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: The Allen and Koomen planner is intractable in two ways: the Allen interval algebra is an intractable temporal reasoner, and the collapsing problem introduces a large branching factor in the search space for a solution plan. We define independence and dependence for networks to address both problems. Independence is used to find a decomposition of an interval network, and dependence is used to focus search when faced with the collapsing problem.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: We analyze the problem of computing the minimal labels for a network of temporal relations in point algebra. Van Beek proposes an algorithm for accomplishing this task, which takes O(max(n3, n2 m)) time (for n points and m ≠-relations). We show that the proof of the correctness of this algorithm given by van Beek and Cohen is faulty, and we provide a new proof showing that the algorithm is indeed correct.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: As influence diagrams become a popular representational tool for decision analysis, influence diagram evaluation attracts more and more research interests. In this article, we present a new, two-phase method for influence diagram evaluation. In our method, an influence diagram is first mapped onto a decision graph and then the analysis is carried out by evaluating the decision graph. Our method is more efficient than Howard and Matheson's because, among other reasons, our method generates a much smaller decision graph for the same influence diagram. Like those most recent algorithms reported in the literature, our method also provides a clean interface between influence diagram evaluation and Bayesian net evaluation. Consequently, various well-established algorithms for Bayesian net evaluation can be used in influence diagram evaluation. Furthermore, our method has a few unique merits. First, it takes advantage of asymmetry in influence diagrams to avoid unnecessary computation. Second, by using heuristic search techniques, it provides an explicit mechanism for using heuristic information that may be available in a domain-specific form. These additional merits make our method more efficient than the current algorithms in general. Finally, by using decision graphs as an intermediate representation, the value of perfect information can be computed in a more efficient way.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Vagueness and uncertainty have attracted the attention of philosophers and logicians for many years. Recently, AI researchers contributed essentially to this area of research. Fuzzy set theory and the theory of evidence are seemingly the most appealing topics. On this note we present a new approach, based on the rough set theory, for looking to these problems. The theory of rough sets seems a suitable mathematical tool for dealing with problems of vagueness and uncertainty. This paper is a modified version of the author's lecture titled “An inquiry into vagueness and uncertainty,” which was delivered at the AI Conference in Wigry (Poland), 1994.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: This paper presents results of experiments showing how machine learning methods arc useful for rule induction in the process of knowledge acquisition for expert systems. Four machine learning methods were used: ID3, ID3 with dropping conditions, and two options of the system LERS (Learning from Examples based on Rough Sets): LEM1 and LEM2. Two knowledge acquisition options of LERS were used as well. All six methods were used for rule induction from six real-life data sets. The main objective was to lest how an expert system, supplied with these rule sets, performs without information on a few attributes. Thus an expert system attempts to classify examples with all missing values of some attributes. As a result of experiments, it is clear that all machine learning methods performed much worse than knowledge acquisition options of LERS. Thus, machine learning methods used for knowledge acquisition should be replaced by other methods of rule induction that will generate complete sets of rules. Knowledge acquisition options of LERS are examples of such appropriate ways of inducing rules for building knowledge bases.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Knowledge discovery in databases, or dala mining, is an important direction in the development of data and knowledge-based systems. Because of the huge amount of data stored in large numbers of existing databases, and because the amount of data generated in electronic forms is growing rapidly, it is necessary to develop efficient methods to extract knowledge from databases. An attribute-oriented rough set approach has been developed for knowledge discovery in databases. The method integrates machine-learning paradigm, especially learning-from-examples techniques, with rough set techniques. An attribute-oriented concept tree ascension technique is first applied in generalization, which substantially reduces the computational complexity of database learning processes. Then the cause-effect relationship among the attributes in the database is analyzed using rough set techniques, and the unimportant or irrelevant attributes are eliminated. Thus concise and strong rules with little or no redundant information can be learned efficiently. Our study shows that attribute-oriented induction combined with rough set theory provide an efficient and effective mechanism for knowledge discovery in database systems.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: This paper presents an empirical study of the use of the rough set approach to reduction of data for a neural network classifying objects described by quantitative and qualitative attributes. Two kinds of reduction are considered: reduction of the set of attributes and reduction of the domains of attributes. Computational tests were performed with five data sets having different character, for original and two reduced representations of data. The learning time acceleration due to data reduction is up to 4.72 times. The resulting increase of misclassification error does not exceed 11.06%. These promising results let us claim that the rough set approach is a useful tool for preprocessing of data for neural networks.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: In this paper, we introduce the notion of interval structures in an attempt to establish a unified framework for representing uncertain information. Two views are suggested for the interpretation of an interval structure. A typical example using the compatibility view is the rough set model in which the lower and upper approximations form an interval structure. Incidence calculus adopts the allocation view in which an interval structure is defined by the tightest lower and upper incidence bounds. The relationship between interval structures and interval-based numeric belief and plausibility functions is also examined. As an application of the proposed model, an algorithm is developed for computing the tightest incidence bounds.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: “Simpson's paradox,” first described nearly a century ago, is an anomaly that sometimes arises from pooling data. Dramatic instances of the paradox have occurred in real life in the domains of epidemiology and admissions policies. Many writers have recently described hypothetical examples of the paradox arising in other areas of life and it seems possible that the paradox may occur frequently in mundane domains but with less serious implications. Thus, it is not surprising that the paradox should arise in commonsense reasoning, that subarea of artificial intelligence that seeks to axiomatize reasoning in such mundane domains. It arises as the problem “approximate proof by cases” and the question of whether to accept it may well depend on whether we wish to construct performance or competence models of reasoning. This article gives a brief history of the paradox and discusses its occurrence in our own discipline. It argues that if the paradox occurs frequently but undramatically in real life, every uncertain reasoning system will have to deal with the problem in some way.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...