ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (169,482)
  • 2020-2024  (723)
  • 2005-2009  (66,985)
  • 2000-2004  (58,040)
  • 1980-1984  (32,409)
  • 1925-1929
  • Computer Science  (169,482)
Collection
  • Books  (67)
  • Articles  (169,482)
Source
Keywords
Publisher
Years
Year
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    GDKAT: A goal-driven knowledge acquisition tool for knowledge base development (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Expert systems 17 (2000), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: While knowledge-based systems are being used extensively to assist in making decisions, a critical factor that affects their performance and reliability is the quantity and quality of the knowledge bases. Knowledge acquisition requires the design and development of an in-depth comprehension of knowledge modeling and of applicable domain. Many knowledge acquisition tools have been developed to support knowledge base development. However, a weakness that is revealed in these tools is the domain-dependent and complex acquisition process. Domain dependence limits the applicable areas and the complex acquisition process makes the tool difficult to use. In this paper, we present a goal-driven knowledge acquisition tool (GDKAT) that helps elicit and store experts’ declarative and procedural knowledge in knowledge bases for a user-defined domain. The designed tool is implemented using the object-oriented design methodology under C++ Windows environment. An example that is used to demonstrate the GDKAT is also delineated. While the application domain for the example presented is reflow soldering in surface mount printed circuit board assembly, the GDKAT can be used to develop knowledge bases for other domains also.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1468-0394.00131
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A connectionist inference model for pattern-directed knowledge representation (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Expert systems 17 (2000), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In this paper we propose a connectionist model for variable binding. The model is topology dependent on the graph it builds based on the predicates available. The irregular connections between perceptron-like assemblies facilitate forward and backward chaining. The model treats the symbolic data as a sequence and represents the training set as a partially connected network using basic set and graph theory to form the internal representation. Inference is achieved by opportunistic reasoning via the bidirectional connections. Consequently, such activity stabilizes to a multigraph. This multigraph is composed of isomorphic subgraphs which all represent solutions to the query made. Such a model has a number of advantages over other methods in that irrelevant connections are avoided by superimposing positionally dependent sub-structures that are identical, variable binding can be encoded and multiple solutions can be extracted simultaneously. The model also has the ability to adapt its existing architecture when presented with new clauses and therefore add new relationships/rules to the model explicitly; this is done by some partial retraining of the network due to the superimposition properties.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1468-0394.00132
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    News (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Expert systems 17 (2000), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1468-0394.00133
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Diary (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Expert systems 17 (2000), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1468-0394.00134
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Editorial: Symbol processing in connectionist systems (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Expert systems 17 (2000), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1468-0394.00122
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    A connectionist production system which can perform both modus ponens and modus tollens simultaneously (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Expert systems 17 (2000), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Modus ponens is used in forward inference and backward inference, where the truth of the conclusion is inferred from the truth of the premise. In modus tollens, the falseness of the premise is inferred from the falseness of the conclusion. Although modus ponens is used in general connectionist production systems, modus tollens is rarely used, except in Quinlan’s proposed INFERNO system and in the system proposed by Thornber. A connectionist production system called ConnPS that can perform both modus ponens and modus tollens simultaneously is described. Compared to the INFERNO system, one of the advantages of ConnPS is its supervised learning ability. The rules and examples given as external knowledge are often erroneous and incomplete. In ConnPS, these rules can be refined by using the supervised learning. Both positive and negative examples are presented to ConnPS, onto which the external rules and observations are mapped. Moreover, ConnPS’s implementations of implications, conjunctions, disjunctions and negation are intuitively consistent with Boolean logic.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1468-0394.00123
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Connectionist symbolic rule encoding using a generalized phase-locking mechanism (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Expert systems 17 (2000), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper describes a connectionist inference architecture which performs standard symbolic inference on a subclass of first-order predicate calculus. This work first involves constructing efficient connectionist mechanisms to represent basic symbol components, dynamic bindings and basic symbolic inference procedures, and devising a set of algorithms which automatically translates input descriptions to localist neural networks. These connectionist mechanisms are built by taking an existing phase-locking mechanism and extending it further to obtain desirable features to represent and manipulate basic symbol structures. The existing phase-locking mechanism represents dynamic bindings very efficiently using temporal synchronous activity between neuron elements but has fundamental limitations in supporting standard symbolic inference. The extension addresses these limitations. The extended system encodes a significant subset of a Horn clause language in a connectionist style.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1468-0394.00124
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Fractal encoding of context-free grammars in connectionist networks (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Expert systems 17 (2000), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Connectionist network learning of context-free languages has so far been applied only to very simple cases and has often made use of an external stack. Learning complex context-free languages with a homogeneous neural mechanism looks like a much harder problem. The current paper takes a step toward solving this problem by analyzing context-free grammar computation (without addressing learning) in a class of analog computers called dynamical automata, which are naturally implemented in connectionist networks. The result is a widely applicable method of using fractal sets to organize infinite-state computations in a bounded state space. An appealing consequence is the development of parameter-space maps, which locate various complex computers in spatial relationships to one another. An example suggests that such a global perspective on the organization of the parameter space may be helpful for solving the hard problem of getting connectionist networks to learn complex grammars from examples.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1468-0394.00126
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Analogy retrieval and processing with distributed vector representations (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Expert systems 17 (2000), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Holographic reduced representations (HRRs) are a method for encoding nested relational structures in fixed-width vector representations. HRRs encode relational structures as vector representations in such a way that the superficial similarity of the vectors reflects both superficial and structural similarity of the relational structures. HRRs also support a number of operations that could be very useful in psychological models of human analogy processing: fast estimation of superficial and structural similarity via a vector dot-product; finding corresponding objects in two structures; and chunking of vector representations. Although similarity assessment and discovery of corresponding objects both theoretically take exponential time to perform fully and accurately, with HRRs one can obtain approximate solutions in constant time. The accuracy of these operations with HRRs mirrors patterns of human performance on analog retrieval and processing tasks.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1468-0394.00125
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    News (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Expert systems 17 (2000), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1468-0394.00127
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 11
    Electronic Resource
    Electronic Resource
    Diary (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Expert systems 17 (2000), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1468-0394.00128
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 12
    Electronic Resource
    Electronic Resource
    LEARNING TO IMPROVE REASONING (2005)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.2005.00276.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 13
    Electronic Resource
    Electronic Resource
    QUERY ROUTING IN A PEER-TO-PEER SEMANTIC LINK NETWORK (2005)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: A semantic link peer-to-peer (P2P) network specifies and manages semantic relationships between peers' data schemas and can be used as the semantic layer of a scalable Knowledge Grid. The proposed approach consists of an automatic semantic link discovery method, a tool for building and maintaining P2P semantic link networks (P2PSLNs), a semantic-based peer similarity measurement for efficient query routing, and the schema mapping algorithms for query reformulation and heterogeneous data integration. The proposed approach has three important aspects. First, it uses semantic links to enrich the relationships between peers' data schemas. Second, it considers not only nodes but also the XML structure in measuring the similarity between schemas to efficiently and accurately forward queries to relevant peers. Third, it copes with semantic and structural heterogeneity and data inconsistency so that peers can exchange and translate heterogeneous information within a uniform view.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2005.00271.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 14
    Electronic Resource
    Electronic Resource
    Title Index, Volume 21 (2005)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.2005.00284.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 15
    Electronic Resource
    Electronic Resource
    PREPROCESSING RULES FOR TRIANGULATION OF PROBABILISTIC NETWORKS (2005)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Currently, the most efficient algorithm for inference with a probabilistic network builds upon a triangulation of a network's graph. In this paper, we show that pre-processing can help in finding good triangulations for probabilistic networks, that is, triangulations with a maximum clique size as small as possible. We provide a set of rules for stepwise reducing a graph, without losing optimality. This reduction allows us to solve the triangulation problem on a smaller graph. From the smaller graph's triangulation, a triangulation of the original graph is obtained by reversing the reduction steps. Our experimental results show that the graphs of some well-known real-life probabilistic networks can be triangulated optimally just by preprocessing; for other networks, huge reductions in their graph's size are obtained.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.2005.00274.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 16
    Electronic Resource
    Electronic Resource
    Agent-Based Web Services Framework and Development Environment (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The current Web services technologies have not exploited sufficient semantics and approaches to dynamic service-oriented operations in open environments. This paper argues that such operations can be realized through agent-oriented interaction approaches. The key challenge is to develop an integration framework for the two paradigms, agent- and service-oriented, in a way that capitalizes on their individual strengths. This paper proposes the notion of agent-based Web services (AWS). We address several critical issues, including the appropriate architectural framework and the structure of its main elements (agent-based Web services), their meta-model, supporting technologies, integration method, and implementation approach. An integrated development environment for this framework called SOAStudio has been developed and tested by implementing a case study of a reverse auction e-marketplace.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00260.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 17
    Electronic Resource
    Electronic Resource
    New Concepts in Evolutionary Search for Boolean Functions in Cryptology (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In symmetric cryptology the resistance to attacks depends critically on the nonlinearity properties of the Boolean functions describing cipher components like Substitution boxes (S-boxes). Some of the most effective methods known to generate functions that satisfy multiple criteria are based on evolutionary heuristics. In this paper, we improve on these algorithms by employing an adaptive strategy. Additionally, using recent improvements in the understanding of these combinatorial structures, we discover essential properties of the graph formed by affine equivalence classes of Boolean functions, which offers several advantages as a conceptual model for multiobjective seeking evolutionary heuristics. Finally, we propose the first major global cooperative effort to discover new bounds for cryptographic properties of Boolean functions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00246.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 18
    Electronic Resource
    Electronic Resource
    Preface (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00232.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 19
    Electronic Resource
    Electronic Resource
    Extended Semantics and Optimization Algorithms for CP-Networks (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. Ceteris paribus (CP)-nets were designed to make the process of preference elicitation simpler and more intuitive for lay users by graphically structuring a set of CP preference statements—preference statements that most people find natural and intuitive. Beside their usefulness in the process of preference elicitation, CP-nets support efficient optimization algorithms that are crucial in most applications (e.g., the selection of the best action to execute or the best product configuration). In various contexts, CP-nets with an underlying cyclic structure emerge naturally. Often, they are inconsistent according to the current semantics, and the user is required to revise them. In this paper, we show how optimization queries can be meaningfully answered in many “inconsistent” networks without troubling the user with requests for revisions. In addition, we describe a method for focusing the user's revision process when revisions are truly needed. In the process, we provide a formal semantics that justifies our approach and new techniques for computing optimal outcomes. Some of the methods we use are based on a reduction to the problem of computing stable models for nonmonotonic logic programs, and we explore this relationship closely.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00236.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 20
    Electronic Resource
    Electronic Resource
    A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In recent years, there has been a large amount of disparate work concerning the representation and reasoning with qualitative preferential information by means of approaches to nonmonotonic reasoning. Given the variety of underlying systems, assumptions, motivations, and intuitions, it is difficult to compare or relate one approach with another. Here, we present an overview and classification for approaches to dealing with preference. A set of criteria for classifying approaches is given, followed by a set of desiderata that an approach might be expected to satisfy. A comprehensive set of approaches is subsequently given and classified with respect to these sets of underlying principles.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00240.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 21
    Electronic Resource
    Electronic Resource
    Evaluation Metrics in Classification: A Quantification of Distance-Bias (2003)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 19 (2003), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This article provides a characterization of bias for evaluation metrics in classification (e.g., Information Gain, Gini, χ2, etc.). Our characterization provides a uniform representation for all traditional evaluation metrics. Such representation leads naturally to a measure for the distance between the bias of two evaluation metrics. We give a practical value to our measure by observing the distance between the bias of two evaluation metrics and its correlation with differences in predictive accuracy when we compare two versions of the same learning algorithm that differ in the evaluation metric only. Experiments on real-world domains show how the expectations on accuracy differences generated by the distance-bias measure correlate with actual differences when the learning algorithm is simple (e.g., search for the best single feature or the best single rule). The correlation, however, weakens with more complex algorithms (e.g., learning decision trees). Our results show how interaction among learning components is a key factor to understand learning performance.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00224
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 22
    Electronic Resource
    Electronic Resource
    Web Discovery and Filtering Based on Textual Relevance Feedback Learning (2003)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 19 (2003), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We develop a new approach for Web information discovery and filtering. Our system, called WID, allows the user to specify long-term information needs by means of various topic profile specifications. An entire example page or an index page can be accepted as input for the discovery. It makes use of a simulated annealing algorithm to automatically explore new Web pages. Simulated annealing algorithms possess some favorable properties to fulfill the discovery objectives. Information retrieval techniques are adopted to evaluate the content-based relevance of each page being explored. The hyperlink information, in addition to the textual context, is considered in the relevance score evaluation of a Web page. WID allows users to provide three forms of the relevance feedback model, namely, the positive page feedback, the negative page feedback, and the positive keyword feedback. The system is domain independent and does not rely on any prior knowledge or information about the Web content. Extensive experiments have been conducted to demonstrate the effectiveness of the discovery performance achieved by WID.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00217
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 23
    Electronic Resource
    Electronic Resource
    A Study of AdaBoost with Naive Bayesian Classifiers: Weakness and Improvement (2003)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 19 (2003), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This article investigates boosting naive Bayesian classification. It first shows that boosting does not improve the accuracy of the naive Bayesian classifier as much as we expected in a set of natural domains. By analyzing the reason for boosting's weakness, we propose to introduce tree structures into naive Bayesian classification to improve the performance of boosting when working with naive Bayesian classification. The experimental results show that although introducing tree structures into naive Bayesian classification increases the average error of the naive Bayesian classification for individual models, boosting naive Bayesian classifiers with tree structures can achieve significantly lower average error than both the naive Bayesian classifier and boosting the naive Bayesian classifier, providing a method of successfully applying the boosting technique to naive Bayesian classification. A bias and variance analysis confirms our expectation that the naive Bayesian classifier is a stable classifier with low variance and high bias. We show that the boosted naive Bayesian classifier has a strong bias on a linear form, exactly the same as its base learner. Introducing tree structures reduces the bias and increases the variance, and this allows boosting to gain advantage.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00219
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 24
    Electronic Resource
    Electronic Resource
    THE DESIGN OF A STATISTICAL ALGORITHM FOR RESOLVING STRUCTURAL AMBIGUITY IN “V NP1 usde NP0” (2003)
    350 Main Street , Malden , MA 02148 , USA : Blackwell Publishing
    Computational intelligence 19 (2003), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The existence of structural ambiguity in modifying clauses renders noun phrase (NP) extraction from running Chinese texts complicated. It is shown from previous experiments that nearly 33% of the errors in an NP extractor were actually caused by the use of clause modifiers. For example, consider the sequence “V + NP1+〈inlineGraphic alt="inline image" href="urn:x-wiley:08247935:COIN201:COIN_201_mu1" location="equation/COIN_201_mu1.gif"/〉 (of) + NP0.” It can be interpreted as two alternatives, a verb phrase (i.e., [V[NP1+〈inlineGraphic alt="inline image" href="urn:x-wiley:08247935:COIN201:COIN_201_mu2" location="equation/COIN_201_mu2.gif"/〉+ NP0]NP]VP) or a noun phrase (i.e., [[V NP1]VP+〈inlineGraphic alt="inline image" href="urn:x-wiley:08247935:COIN201:COIN_201_mu3" location="equation/COIN_201_mu3.gif"/〉+ NP0]NP). To resolve this ambiguity, syntactical, contextual, and semantics-based approaches are investigated in this article. The conclusion is that the problem can be overcome only when the semantic knowledge about words is adopted. Therefore, a structural disambiguation algorithm based on lexical association is proposed. The algorithm uses the semantic class relation between a word pair derived from a standard Chinese thesaurus, 〈inlineGraphic alt="inline image" href="urn:x-wiley:08247935:COIN201:COIN_201_mu4" location="equation/COIN_201_mu4.gif"/〉, to work out whether a noun phrase or a verb phrase has a stronger lexical association within the collocation. This can, in turn, determine the intended phrase structure. With the proposed algorithm, the best accuracy and coverage are 79% and 100%, respectively. The experiment also shows that the backed-off model is more effective for this purpose. With this disambiguation algorithm, parsing performance can be significantly improved.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00214
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 25
    Electronic Resource
    Electronic Resource
    Distributed Reputation Management for Electronic Commerce (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: One of the major challenges for electronic commerce is how to establish a relationship of trust between different parties. Establishing trust is nontrivial, because the traditional physical or social means of trust cannot apply directly in virtual settings. In many cases, the parties involved may not ever have interacted before. Reputation systems seek to address the development of trust by recording the reputations of different parties. However, most existing reputation systems are restricted to individual market websites. Further, relevant information about a party may come from several websites and from interactions that were not mediated by any website.This paper considers the problem of automatically collecting ratings about a given party from others. Our approach involves a distributed agent architecture and adapts the mathematical theory of evidence to represent and propagate the ratings that participants give to each other. When evaluating the trustworthiness of a given party, a peer combines its local evidence (based on direct prior interactions with the party) with the testimonies of others regarding the same party. This approach satisfies certain important properties of distributed reputation management and is experimentally evaluated through simulations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00202
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 26
    Electronic Resource
    Electronic Resource
    Design of a Multi–Unit Double Auction E–Market (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We envision a future economy where e–markets will play an essential role as exchange hubs for commodities and services. Future e–markets should be designed to be robust to manipulation, flexible, and sufficiently efficient in facilitating exchanges. One of the most important aspects of designing an e–market is market mechanism design. A market mechanism defines the organization, information exchange process, trading procedure, and clearance rules of a market. If we view an e–market as a multi–agent system, the market mechanism also defines the structure and rules of the environment in which agents (buyers and sellers) play the market game. We design an e–market mechanism that is strategy–proof with respect to reservation price, weakly budget–balanced, and individually rational. Our mechanism also makes sellers unlikely to underreport the supply volume to drive up the market price. In addition, by bounding our market’s efficiency loss, we provide fairly unrestrictive sufficient conditions for the efficiency of our mechanism to converge in a strong sense when (1) the number of agents who successfully trade is large, or (2) the number of agents, trading and not, is large. We implement our design using the RETSINA infrastructure, a multi–agent system development toolkit. This enables us to validate our analytically derived bounds by numerically testing our e–market.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.t01-1-00206
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 27
    Electronic Resource
    Electronic Resource
    Introduction to the Special Issue (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00189
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 28
    Electronic Resource
    Electronic Resource
    English–Thai Structure–Based Machine Translation (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We propose an alternative method of machine–aided translation: Structure–Based Machine Translation (SBMT). SBMT uses language structure matching techniques to reduce complicated grammar rules and provide efficient and feasible translation results. SBMT comprises the following four features: (1) source language input sentence analysis; (2) source language sentence transformation into target language structure; (3) dictionary lookup; and (4) semantic disambiguation or word sense disambiguation (WSD) for correct output selection. SBMT has been designed and a prototype system has been implemented that generates satisfactory translations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00192
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 29
    Electronic Resource
    Electronic Resource
    An ACL for a Dynamic System of Agents (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In this article we present the design of an ACL for a dynamic system of agents. The ACL includes a set of conversation performatives extended with operations to register, create, and terminate agents. The main design goal at the agent–level is to provide only knowledge–level primitives that are well integrated with the dynamic nature of the system. This goal has been achieved by defining an anonymous interaction protocol which enables agents to request and supply knowledge without considering symbol–level issues concerning management of agent names, routing, and agent reachability. This anonymous interaction protocol exploits a distributed facilitator schema which is hidden at the agent–level and provides mechanisms for registering capabilities of agents and delivering requests according to the competence of agents. We present a formal specification of the ACL and of the underlying architecture, exploiting an algebra of actors, and illustrate it with the help of a graphical notation. This approach provides the basis for discussing dynamic primitives in ACL and for studying properties of dynamic multi agent systems, for example concerning the behavior of agents and the correctness of their conversation policies.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00185
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 30
    Electronic Resource
    Electronic Resource
    Control and Communication in Mental Computation (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00175
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 31
    Electronic Resource
    Electronic Resource
    Development as a Cause in Developmental Disorders: (Commentary on “Control and Cross-Domain Mental Computation: Evidence from Language Breakdown” by William Frawley) (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00181
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 32
    Electronic Resource
    Electronic Resource
    A Complexity-Level Analysis of the Sensor Planning Task for Object Search (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00166
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 33
    Electronic Resource
    Electronic Resource
    Granularity in Relational Formalisms—With Application to Time and Space Representation (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Temporal and spatial phenomena can be seen at a more or less precise granularity, depending on the kind of perceivable details. As a consequence, the relationship between two objects may differ depending on the granularity considered. When merging representations of different granularity, this may raise problems. This paper presents general rules of granularity conversion in relation algebras. Granularity is considered independently of the specific relation algebra, by investigating operators for converting a representation from one granularity to another and presenting six constraints that they must satisfy. The constraints are shown to be independent and consistent and general results about the existence of such operators are provided. The constraints are used to generate the unique pairs of operators for converting qualitative temporal relationships (upward and downward) from one granularity to another. Then two fundamental constructors (product and weakening) are presented: they permit the generation of new qualitative systems (e.g. space algebra) from existing ones. They are shown to preserve most of the properties of granularity conversion operators.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00170
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 34
    Electronic Resource
    Electronic Resource
    Applications of Rough Genetic Algorithms (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper describes rough genetic algorithms based on the notion of interval values. A gene in a rough genetic algorithm can be represented using an interval. The paper explains how this generalization facilitates development of new genetic operators and evaluation measures. Various operations of rough genetic algorithms are illustrated using a simple document retrieval example. An experiment involving classification of interval-valued traffic patterns demonstrates the usefulness of rough genetic algorithms for real-world applications. A discussion on further extensions of rough genetic algorithms to rough sets is also included.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00156
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 35
    Electronic Resource
    Electronic Resource
    Incomplete Information Tables and Rough Classification (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The rough set theory, based on the original definition of the indiscernibility relation, is not useful for analysing incomplete information tables where some values of attributes are unknown. In this paper we distinguish two different semantics for incomplete information: the “missing value” semantics and the “absent value” semantics. The already known approaches, e.g. based on the tolerance relations, deal with the missing value case. We introduce two generalisations of the rough sets theory to handle these situations. The first generalisation introduces the use of a non symmetric similarity relation in order to formalise the idea of absent value semantics. The second proposal is based on the use of valued tolerance relations. A logical analysis and the computational experiments show that for the valued tolerance approach it is possible to obtain more informative approximations and decision rules than using the approach based on the simple tolerance relation.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00162
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 36
    Electronic Resource
    Electronic Resource
    A Case-Addition Policy for Case-Base Maintenance (2001)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: A major problem in many practical applications of case-based reasoning (CBR) and knowledge reuse is how to keep the case bases concise and complete. To solve this problem requires repeated maintenance operations to be applied to case bases. Different maintenance policies may result in case bases with very different quality. In this article, we present a case-addition maintenance policy that is guaranteed to return a concise case base with good coverage quality. We demonstrate that the coverage of the case base computed by the case-addition algorithm is no worse than the optimal case-base coverage by a fixed lower bound. We also show that the algorithm implementing the case-addition policy is efficient. Our result also highlights benefit reduction as a key factor in influencing the convergence of case-base coverage when cases are added to a case base. Through our theoretical analysis, we analytically derive the well known coverage convergence curves commonly displayed in CBR experiments and show that benefit reduction can be used as a predictor for convergence speed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00143
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 37
    Electronic Resource
    Electronic Resource
    Case-Base Maintenance in a Multimodal Reasoning System (2001)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The definition of suitable case-base maintenance policies is widely recognized as a major key to success for case-based systems; underestimating this issue may lead to systems that either do not fulfill their role of knowledge management and preservation or that do not perform adequately under performance dimensions, namely, computation time and competence and quality of solutions. The goal of this article is to analyze some automatic case-base management strategies in the context of a multimodal architecture combining case-based reasoning and model-based reasoning. We propose and compare two different methodologies, the first one, called replace, is a competence-based strategy aimed at replacing a set of stored cases with the current one, if the latter exhibits an estimated competence comparable with the estimated competence of the considered set of stored cases. The second one, called learning by failure with forgetting (LFF), is based on incremental learning of cases interleaved with off-line processes of forgetting (deleting) cases whose usage does not fulfill specific utility conditions. Results from an extensive experimental analysis in an industrial plant diagnosis domain are reported, showing the usefulness of both strategies with respect to the maintenance of suitable performance levels for the target system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00144
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 38
    Electronic Resource
    Electronic Resource
    Maintaining Retrieval Knowledge in a Case-Based Reasoning System (2001)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The knowledge stored in a case base is central to the problem solving of a case-based reasoning (CBR) system. Therefore, case-base maintenance is a key component of maintaining a CBR system. However, other knowledge sources, such as indexing and similarity knowledge for improved case retrieval, also play an important role in CBR problem solving. For many CBR applications, the refinement of this retrieval knowledge is a necessary component of CBR maintenance. This article focuses on optimization of the parameters and feature selections/weights for the indexing and nearest-neighbor algorithms used by CBR retrieval. Optimization is applied after case-base maintenance and refines the CBR retrieval to reflect changes that have occurred to cases in the case base. The optimization process is generic and automatic, using knowledge contained in the cases. In this article we demonstrate its effectiveness on a real tablet formulation application in two maintenance scenarios. One scenario, a growing case base, is provided by two snapshots of a formulation database. A change in the company's formulation policy results in a second, more fundamental requirement for CBR maintenance. We show that after case-base maintenance, the CBR system did indeed benefit from also refining the retrieval knowledge. We believe that existing CBR shells would benefit from including an option to automatically optimize the retrieval process.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00149
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 39
    Electronic Resource
    Electronic Resource
    Granular Computing: a Rough Set Approach (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We discuss information granule calculi as a basis of granular computing. They are defined by constructs like information granules, basic relations of inclusion and closeness between information granules as well as operations on them. The exact interpretation between granule languages of different information sources (agents) often does not exist. Hence (rough) inclusion and closeness of granules are considered instead of their equality. Examples of all the basic constructs of information granule calculi are presented. The construction of more complex information granules is described by expressions called terms. We discuss the synthesis problem of robust terms, i.e., descriptions of information granules, satisfying a given specification in a satisfactory degree. We also present a method for synthesis of information granules represented by robust terms (approximate schemes of reasoning) by means of decomposition of specifications for such granules. The discussed problems of granular computing are of special importance for many applications, in particular related to spatial reasoning as well as to knowledge discovery and data mining.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00161
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 40
    Electronic Resource
    Electronic Resource
    Evolving Granules for Classification for Discovering Difference in the Usage of Words (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper proposes an evolutionary approach for discovering difference in the usage of words to facilitate collaboration among people. In general, different people seem to have different ways of conception and thus can have different concepts even on the same thing. When people try to communicate their concepts with words, such difference in the meaning and usage can lead to misunderstanding in communication, which can hinder their collaboration. In our approach each granule of knowledge in classification from users is structured into a decision tree so that difference in the usage of words can be discovered as difference in the structure of decision trees. By treating each granule of classification knowledge (i.e., decision tree) as an individual in Genetic Algorithm (GA), evolution is carried out with respect to both classification efficiency of each individual and diversity as a population so that the granule for classification is gradually evolved with diverse structure. Experiments were carried out on motor diagnosis cases with artificially encoded difference in the usage of words and the result shows the effectiveness of the proposed evolutionary approach.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00164
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 41
    Electronic Resource
    Electronic Resource
    Review and Restore for Case-Base Maintenance (2001)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Case-base maintenance is one of the most important issues for current research in case-based reasoning (CBR). In this article we propose an extended six-step CBR cycle and discuss its two additional steps as part of the maintenance phase of the CBR process. The review step covers assessment and monitoring of the knowledge containers, whereas the restore step actually modifies the contents of the containers according to recommendations resulting from the review step in order to keep the knowledge containers in a usable state. Here we focus our attention on the case base. For the review step, we define several quality measures based on different case and case-base properties that describe specific characteristics of the case base such as correctness, consistency, uniqueness, minimality, and incoherence. Then we use these measures to realize monitoring capabilities for the case-base container that indicate when the restore step is necessary. Finally, we also describe several methods for modifications of the case base in the restore step and their relation to the review step. An initial experimental evaluation shows the appropriateness of the proposed concepts and methods before we conclude the article with a discussion of related work and an outline of future directions to extend these aspects of maintenance in CBR.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00141
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 42
    Electronic Resource
    Electronic Resource
    Intelligent Case-Authoring Support in Casemaker-2 (2001)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: CaseMaker is an interactive environment for intelligent case-authoring support in CREST, a case-based reasoner for estimation tasks, in which the selection of cases for addition to a case library is guided by empirical evaluation of the coverage contributions of candidate cases. I present a new version of the environment called CaseMaker-2 that is designed to support case authoring more effectively by eliminating a previous requirement for the evaluation of candidate cases to be repeated following the addition of a new case to the library. A key role in the approach is played by an algorithm for dynamic partitioning of the space of uncovered cases in such a way that the partition containing a given case represents the minimum additional coverage provided by its addition to the case library.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00148
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 43
    Electronic Resource
    Electronic Resource
    Wishful: A Discourse Planning System That Considers a User's Inferences[Address co] (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The explicit consideration of an addressee's inferences during discourse planning affects the content and coherence of the generated discourse. The content of the discourse is affected because the consideration of an addressee's inferences may require the addition of information that addresses erroneous inferences or suggest the omission of easily inferred information. The coherence of the discourse is affected because the generated discourse should incorporate inferential relations that emerge from the consideration of an addressee's inferences. In this article, we describe a discourse planner that takes into consideration a user's inferences. In particular, we discuss its content planning and discourse structuring mechanisms. The content planning mechanism generates a set of rhetorical devices that achieves a given communicative goal. The discourse structuring mechanism takes into consideration schematic, inferential, and prescriptive relations between these rhetorical devices in order to organize them into a coherent sequence. Our discourse planner has been implemented in a system called WISHFUL that generates explanations about concepts in technical domains. We evaluated WISHFUL's performance to test the effect of considering a user's inferences during content planning and discourse organization and also to determine the suitability of the discourse produced by WISHFUL for different types of users. The results of our evaluation endorse the ideas embodied in the WISHFUL system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00133
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 44
    Electronic Resource
    Electronic Resource
    Introduction To the Special Issue on the 1999 Pacific Association for Computational Linguistics Conference (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00122
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 45
    Electronic Resource
    Electronic Resource
    Probability-Based Chinese Text Processing and Retrieval (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We discuss the use of probability-based natural language processing for Chinese text retrieval. We focus on comparing different text extraction methods and probabilistic weighting methods. Several document processing methods and probabilistic weighting functions are presented. A number of experiments have been conducted on large standard text collections. We present the experimental results that compare a word-based text processing method with a character-based method. The experimental results also compare a number of term-weighting functions including both single-unit weighting and compound-unit weighting functions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00126
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 46
    Electronic Resource
    Electronic Resource
    Query-Biased Summarization Based on Lexical Chaining (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Recently, the prevalence of information retrieval engines has created an important application of the automatic summarization as the display of retrieval results, whereby the user can quickly and accurately judge the relevance of texts returned as a result of a query. Here, rather than producing a generic summary, the summary that reflects the user's topic of interest (information need) expressed in the query would be considered as more suitable. This type of summary is often called query-biased summary.In this paper we present a method for producing query-biased summaries using lexical chains. Lexical chains are sequences of words that are in lexical cohesion relation with each other, and tend to indicate fragments of a text that form a semantic unit. Using lexical chains would enable to produce more coherent and readable summaries than previous approaches to query-biased summarization.To evaluate the effectiveness of our method, a task-based evaluation scheme is adopted. The results from the experiments show that query-biased summaries by lexical chains outperform others in the accuracy of subjects' relevance judgments.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00128
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 47
    Electronic Resource
    Electronic Resource
    Second-Order Cohesion (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Similarity in contextual behavior between words is considered a source of ‘lexical cohesion,’ which is otherwise hard to measure or quantify. Such contextual similarity is used by an implementation for text segmentation, the VecTile system, which uses precompiled vector representations of words to produce similarity curves over texts. The performance of this system is shown to improve over that of the TextTiling algorithm of Hearst (1997).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00124
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 48
    Electronic Resource
    Electronic Resource
    Construction of Deliberation Structure in E-Mail Communication (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We propose a model, called a deliberation structure model, that represents streams of relevant messages in email communication. The deliberation structure model treats e-mail messages that include several topics and uses tree structure, called deliberation trees, that are based on Clark's contribution trees to represent message structure. Deliberation trees are useful to visualize the message structure. A method for constructing the deliberation structure is showed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00127
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 49
    Electronic Resource
    Electronic Resource
    Using Images As a Foundation for Natural Language Processing (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: A new framework for knowledge representation is proposed, based on modality-dependent (sight, sound, touch) images, within which agents will be better able to communicate using natural languages. The premise is that natural language processing depends not only on the grammatical rules but also on entities (whatever the agents are communicating about), their attributes, and supported events (in a time/space continuum). We call the collection of an entity's associated attributes a state. The description of a concept is refined when new information about the concept is encountered through discovery of consistency between the attributes belonging to different image instances.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00130
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 50
    Electronic Resource
    Electronic Resource
    Strategies in Human Nonmonotonic Reasoning (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Although humans seem adept at drawing nonmonotonic conclusions, the nonmonotonic reasoning systems that researchers develop are complex and do not function with such ease. This paper explores people's reasoning processes in nonmonotonic problems. To avoid the problem of people's conclusions being based on knowledge rather than on some reasoning process, we developed a scenario about life on another planet. Problems were chosen to allow the systematic study of people's understanding of strict and nonstrict rules and their interactions. We found that people had great difficulty reasoning and we identified a number of negative factors influencing their reasoning. We also identified three positive factors which, if used consistently, would yield rational and coherent reasoning—but no subject achieved total consistency. (Another possible positive factor, specificity, was considered but we found no evidence for its use.) It is concluded that nonmonotonic reasoning is hard. When people need to reason in a domain where they have no preconceived ideas, the foundation for their reasoning is neither coherent nor rational. They do not use a nonmonotonic reasoning system that would work regardless of content. Thus, nonmonotonic reasoning systems that researchers develop are expected to do more reasoning than humans actually do!
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00119
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 51
    Electronic Resource
    Electronic Resource
    Noisy Time-Series Prediction using Pattern Recognition Techniques (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Time-series prediction is important in physical and financial domains. Pattern recognition techniques for time-series prediction are based on structural matching of the current state of the time-series with previously occurring states in historical data for making predictions. This paper describes a Pattern Modelling and Recognition System (PMRS) which is used for forecasting benchmark series and the US S&P financial index. The main aim of this paper is to evaluate the performance of such a system on noise free and Gaussian additive noise injected time-series. The results show that the addition of Gaussian noise leads to better forecasts. The results also show that the Gaussian noise standard deviation has an important effect on the PMRS performance. PMRS results are compared with the popular Exponential Smoothing method.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00108
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 52
    Electronic Resource
    Electronic Resource
    A Guided Tour through some Extensions of the Event Calculus[Address co] (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which properties initiated or terminated by these events hold. In this paper, we conduct a systematic analysis of EC by which we gain a better understanding of this formalism and determine ways of augmenting its expressive power. The keystone of this endeavor is the definition of an extendible formal specification of its functionalities. This formalization has the effects of casting determination of MVIs as a model checking problem, of setting the ground for studying and comparing the expressiveness and complexity of various extensions of EC, and of establishing a semantic reference against which to verify the soundness and completeness of implementations.We extend the range of queries accepted by EC, which is limited to Boolean combinations of MVI verification or computation requests, to support arbitrary quantification over events and modal queries. We also admit specifications based on preconditions. We demonstrate the added expressive power by encoding a number of diagnosis problems. Moreover, we provide a systematic comparison of the expressiveness and complexity of the various extended event calculi against each other. Finally, we propose a declarative encoding of these enriched event calculi in the logic programming language λProlog and prove the soundness and completeness of the resulting logic programs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00115
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 53
    Electronic Resource
    Electronic Resource
    An Integrated Instance-Based Learning Algorithm (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The basic nearest-neighbor rule generalizes well in many domains but has several shortcomings, including inappropriate distance functions, large storage requirements, slow execution time, sensitivity to noise, and an inability to adjust its decision boundaries after storing the training data. This paper proposes methods for overcoming each of these weaknesses and combines the methods into a comprehensive learning system called the Integrated Decremental Instance-Based Learning Algorithm (IDIBL) that seeks to reduce storage, improve execution speed, and increase generalization accuracy, when compared to the basic nearest neighbor algorithm and other learning models. IDIBL tunes its own parameters using a new measure of fitness that combines confidence and cross-validation accuracy in order to avoid discretization problems with more traditional leave-one-out cross-validation. In our experiments IDIBL achieves higher generalization accuracy than other less comprehensive instance-based learning algorithms, while requiring less than one-fourth the storage of the nearest neighbor algorithm and improving execution speed by a corresponding factor. In experiments on twenty-one data sets, IDIBL also achieves higher generalization accuracy than that reported for sixteen major machine learning and neural network models.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00103
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 54
    Electronic Resource
    Electronic Resource
    APPLYING MACHINE LEARNING TO LOW-KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS (2005)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper addresses the question of allocating computational resources among a set of algorithms to achieve the best performance on scheduling problems. Our primary motivation in addressing this problem is to reduce the expertise needed to apply optimization technology. Therefore, we investigate algorithm control techniques that make decisions based only on observations of the improvement in solution quality achieved by each algorithm. We call our approach “low knowledge” since it does not rely on complex prediction models, either of the problem domain or of algorithm behavior. We show that a low-knowledge approach results in a system that achieves significantly better performance than all of the pure algorithms without requiring additional human expertise. Furthermore the low-knowledge approach achieves performance equivalent to a perfect high-knowledge classification approach.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.2005.00278.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 55
    Electronic Resource
    Electronic Resource
    THE DISCIPLE–RKF LEARNING AND REASONING AGENT (2005)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Over the years we have developed the Disciple theory, methodology, and family of tools for building knowledge-based agents. This approach consists of developing an agent shell that can be taught directly by a subject matter expert in a way that resembles how the expert would teach a human apprentice when solving problems in cooperation. This paper presents the most recent version of the Disciple approach and its implementation in the Disciple–RKF (rapid knowledge formation) system. Disciple–RKF is based on mixed-initiative problem solving, where the expert solves the more creative parts of the problem and the agent solves the more routine ones, integrated teaching and learning, where the agent helps the expert to teach it, by asking relevant questions, and the expert helps the agent to learn, by providing examples, hints, and explanations, and multistrategy learning, where the agent integrates multiple learning strategies, such as learning from examples, learning from explanations, and learning by analogy, to learn from the expert how to solve problems. Disciple–RKF has been applied to build learning and reasoning agents for military center of gravity analysis, which are used in several courses at the US Army War College.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.2005.00282.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 56
    Electronic Resource
    Electronic Resource
    AUTOMATICALLY GENERATING TREE ADJOINING GRAMMARS FROM ABSTRACT SPECIFICATIONS (2005)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The paper describes a system that can automatically generate tree adjoining grammars from abstract specifications. Our system is based on the use of tree descriptions to specify a grammar by separately defining pieces of tree structure that encode independent syntactic principles. Various individual specifications are then combined to form the elementary trees of the grammar. The system enables efficient development and maintenance of a grammar, and also allows underlying linguistic constructions (such as wh-movement) to be expressed explicitly. We have carefully designed our system to be as language independent as possible and tested its performance by constructing both English and Chinese grammars, with significant reductions in grammar development time. Provably consistent abstract specifications for different languages also offer unique opportunities for investigating how languages relate to themselves and to each other. For instance, the impact of a linguistic structure such as wh-movement can be traced from its specification to the descriptions that it combines with, to its actual realization in trees. By focusing on syntactic properties at a higher level, our approach allowed a unique comparison of our English and Chinese grammars.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.2005.00273.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 57
    Electronic Resource
    Electronic Resource
    SEMANTICS-ASSISTED PROBLEM SOLVING ON THE SEMANTIC GRID (2005)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In this paper we propose a distributed knowledge management framework for semantics and knowledge creation, population, and reuse on the grid. Its objective is to evolve the Grid toward the Semantic Grid with the ultimate purpose of facilitating problem solving in e-Science. The framework uses ontology as the conceptual backbone and adopts the service-oriented computing paradigm for information- and knowledge-level computation. We further present a semantics-based approach to problem solving, which exploits the rich semantic information of grid resource descriptions for resource discovery, instantiation, and composition. The framework and approach has been applied to a UK e-Science project—Grid Enabled Engineering Design Search and Optimisation in Engineering (GEODISE). An ontology-enabled problem solving environment (PSE) has been developed in GEODISE to leverage the semantic content of GEODISE resources and the Semantic Grid infrastructure for engineering design. Implementation and initial experimental results are reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2005.00269.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 58
    Electronic Resource
    Electronic Resource
    XML DECLARATIVE DESCRIPTION WITH FIRST-ORDER LOGICAL CONSTRAINTS (2005)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The expressive power of XML Declarative Description (XDD), a unified XML-based representation language for the Knowledge Grid, is enhanced by a well-defined mechanism for modeling arbitrary XML first-order logical constraints (FLCs)—a special kind of constraints comprising XML expressions and logical symbols. The resulting knowledge representation can uniformly express explicit and implicit information, ontologies, axioms as well as integrity, structural and FLCs. It facilitates direct use of ordinary XML elements as its basic language component and semantic units, and formally defines XML clauses for modeling advanced complex statements. It achieves sound, efficient, and flexible computation or inference by means of the Equivalent Transformation (ET) paradigm—a new computational model based on semantic preserving transformations. Basic ET computational rules for reasoning with XDD descriptions with FLCs are also presented. Due to its well-founded mechanism and expressiveness, employment of the proposed representation and computation framework to model a knowledge grid and its services not only enables direct representation of knowledge bases described by such emerging Semantic Web ontology languages as RDF(S) and OWL, but also offers additional descriptive facilities by allowing expression of and reasoning with rules, relationships, and constraints. Moreover, in order to provide machine-interpretable descriptions of knowledge grid services, standard service description languages, e.g., WSDL, UDDI, OWL-S and WSMO are employed and extended with facilities to define additional service relationships, constraints, and composition rules.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2005.00268.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 59
    Electronic Resource
    Electronic Resource
    COMPACT DIAGNOSES REPRESENTATION IN DIAGNOSTIC PROBLEM SOLVING (2005)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The paper addresses the problem of finding a compact representation of the diagnoses within a model-based approach to diagnosis. To this end, we introduce the notion of scenario, a special kind of CNF formula over the component variables, which can be used to encode a large number of diagnoses using the same amount of space needed for encoding just a single diagnosis. We show how the solutions to a diagnostic problem can be computed as sets of scenarios by presenting first an exhaustive algorithm and then an efficient algorithm, which exploits probabilistic information to restrict the result set to preferred scenarios. Finally, we discuss the issue of how to efficiently extract preferred diagnoses from sets of scenarios and characterize a class of system models for which our techniques perform particularly well. Concepts and algorithms introduced in the paper have been tested within the prototype of the diagnostic agent of a space robotic arm; resulting statistics are reported and critically discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2005.00264.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 60
    Electronic Resource
    Electronic Resource
    The Advantages of Designing Adaptive Business Agents Using Reputation Modeling Compared to the Approach of Recursive Modeling (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Adaptive business agents operate in electronic marketplaces, learning from past experiences to make effective decisions on behalf of their users. How best to design these agents is an open question. In this article, we present an approach for the design of adaptive business agents that uses a combination of reinforcement learning and reputation modeling. In particular, we take into account the fact that multiple selling agents may offer the same good with different qualities, and that selling agents may alter the quality of their goods. We also consider the possibility of dishonest agents in the marketplace. Our buying agents exploit the reputation of selling agents to avoid interaction with the disreputable ones, and therefore to reduce the risk of purchasing low value goods. We then experimentally compare the performance of our agents with those designed using a recursive modeling approach. We are able to show that agents designed according to our algorithms achieve better performance in terms of satisfaction and computational time and as such are well suited for the design of electronic marketplaces.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00252.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 61
    Electronic Resource
    Electronic Resource
    A Hybrid Intelligent Multiagent System for E-Business (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The paper describes a new multiagent system with enhanced capabilities obtained through a hybrid of intelligent techniques. The processing in the model is handled by two types of agents: distributed agents and a central administrator agent. Localized processing at the individual agents is carried out using mathematical techniques and genetic algorithms. The central administrator agent dynamically obtains information about the problem domain from the Internet and maintains a knowledge pool using a clustering technique called the growing self-organizing map (GSOM). Distributed agents communicate with the central administrator agent if they need further knowledge about the problem domain to provide solutions to user-defined tasks. The approach integrates traditional mathematical, data mining, and evolutionary techniques with a multiagent system. The proposed system is implemented as a travel optimizer application for the e-tourism domain. Finally, the possibilities of integrating the proposed technique with currently available e-tourism applications to provide the customer with enhanced solutions are identified.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00256.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 62
    Electronic Resource
    Electronic Resource
    A Conversational Approach to the Interaction With Web Services (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The emerging standards for the specification of Web Services support the publication of the static interfaces of the operations they may execute. However, little attention is paid to the management of long-lasting interactions between the service providers and their consumers. Although this is not an issue in the case of “one-shot” services, it challenges the provision of services requiring the exchange of multiple messages between the business partners. In this article, we present a conversational model supporting the management of long-lasting interactions where several messages have to be exchanged before the service is completed. Our model aims at facilitating the consumers during the service invocation because in this way the establishment of short-term business relations can be simplified. To this extent, we provide a computational framework that can be exploited to manage a conversation between the consumer and the service provider. Our framework is inspired from the research developed in Computational Linguistics and in the area of Multi-Agent Systems to manage human-to-computer and agent-to-agent dialog. However, we employ techniques suitable to comply with the emerging Web Service standards and with the scalability requirements of the Internet.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00261.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 63
    Electronic Resource
    Electronic Resource
    Design of Montgomery Multiplication Architecture Based on Programmable Cellular Automata (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This study presents a Montgomery multiplication architecture that uses an irreducible all one polynomial (AOP) in GF(2m) based on a programmable cellular automata (PCA). The proposed architecture has the advantage of high regularity and a reduced latency based on combining the characteristics of the irreducible AOP and PCA. The proposed architecture can be used to implement modular exponentiation, division, and inversion architectures.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00248.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 64
    Electronic Resource
    Electronic Resource
    Automated Design of Security Protocols (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Security protocols play an important role in modern communications. However, security protocol development is a delicate task, and experience shows that computer security protocols are notoriously difficult to get right. Recently, Clark and Jacob provided a framework for automatic protocol generation based on combinatorial optimization techniques and the symmetric key part of BAN logic. This paper shows how such an approach can be further developed to encompass the full BAN logic without the loss of efficiency and thereby synthesize public key protocols and hybrid protocols.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00249.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 65
    Electronic Resource
    Electronic Resource
    Preference-Based Constrained Optimization with CP-Nets (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Many artificial intelligence (AI) tasks, such as product configuration, decision support, and the construction of autonomous agents, involve a process of constrained optimization, that is, optimization of behavior or choices subject to given constraints. In this paper we present an approach for constrained optimization based on a set of hard constraints and a preference ordering represented using a CP-network—a graphical model for representing qualitative preference information. This approach offers both pragmatic and computational advantages. First, it provides a convenient and intuitive tool for specifying the problem, and in particular, the decision maker's preferences. Second, it admits an algorithm for finding the most preferred feasible (Pareto-optimal) outcomes that has the following anytime property: the set of preferred feasible outcomes are enumerated without backtracking. In particular, the first feasible solution generated by this algorithm is Pareto optimal.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00234.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 66
    Electronic Resource
    Electronic Resource
    Soft Constraint Propagation and Solving in Constraint Handling Rules (2004)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 20 (2004), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Soft constraints are a generalization of classical constraints, which allow for the description of preferences rather than strict requirements. In soft constraints, constraints and partial assignments are given preference or importance levels, and constraints are combined according to combinators which express the desired optimization criteria. On the other hand, constraint handling rules (CHR) constitute a high-level natural formalism to specify constraint solvers and propagation algorithms. We present a framework to design and specify soft constraint solvers by using CHR. In this way, we extend the range of applicability of CHR to soft constraints rather than just classical ones, and we provide a straightforward implementation for soft constraint solvers.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2004.00239.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 67
    Electronic Resource
    Electronic Resource
    Title Index, Volume 19 (2003)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 19 (2003), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1046/j.0824-7935.2003.00226.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 68
    Electronic Resource
    Electronic Resource
    Can Computers Deliberately Deceive? A Simulation Tool and Its Application to Turing's Imitation Game (2003)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 19 (2003), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In this paper, we describe how agents can deceive within a probabilistic framework for representing their mental state: in doing so, we challenge the so-called sincerity assumption in Human–Computer interaction (HCI) and multi-agent systems (MAS). We distinguish deception from its special case of lie and characterize different forms of deception, by identifying several criteria for distinguishing among them. In particular, we propose a model of information impact on the Receiver's mind. As the message Sender must plan its strategy by considering the Receiver's criteria for believing, we also discuss some of these criteria, like content plausibility, source informativity, and information safety. We apply this model to a simplified version of Turing's Imitation Game and describe how we implemented a Simulator of deceptive strategies that we called Mouth of Truth. We conclude the paper by describing an evaluation study that enabled us to verify the validity of our method and to revise it in part.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00223
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 69
    Electronic Resource
    Electronic Resource
    Semantic-Based Information Retrieval for Content Management and Security (2003)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 19 (2003), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: An information retrieval system has to retrieve all and only those documents that are relevant to a user query, even if index terms and query terms are not matched exactly. However, term mismatches between index terms and query terms have been a serious obstacle to the enhancement of retrieval performance. In this article, we discuss automatic term normalization between words and phrases in text corpora and their application to a Korean information retrieval system. We perform three new types of term normalizations: transliterated word normalization, noun phrase normalization, and context-based term normalization. Transliterated words are normalized into equivalence classes by using contextual similarity to alleviate lexical term mismatches. Then, noun phrases are normalized into phrasal terms by segmenting compound nouns as well as normalizing noun phrases. Moreover, context-based terms are normalized by using a combination of mutual information and word context to establish word similarities. Next, unsupervised clustering is done by using the K-means algorithm and cooccurrence clusters are identified to alleviate semantic term mismatches. These term normalizations are used in both the indexing and the retrieval system. The experimental results show that our proposed system can alleviate three types of term mismatches and can also provide the appropriate similarity measurements. As a result, our system can improve the retrieval effectiveness of the information retrieval system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00215
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 70
    Electronic Resource
    Electronic Resource
    IN MEMORIAM: RAYMOND REITER (2003)
    350 Main Street , Malden , MA 02148 , USA : Blackwell Publishing
    Computational intelligence 19 (2003), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00211
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 71
    Electronic Resource
    Electronic Resource
    HIGH-DIMENSIONAL LEARNING FRAMEWORK 
 FOR ADAPTIVE DOCUMENT FILTERING (2003)
    350 Main Street , Malden , MA 02148 , USA : Blackwell Publishing
    Computational intelligence 19 (2003), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We investigate the unique requirements of the adaptive textual document filtering problem and propose a new high-dimensional on-line learning framework, known as the REPGER (relevant feature pool with good training example retrieval rule) algorithm to tackle this problem. Our algorithm possesses three characteristics. First, it maintains a pool of selective features with potentially high predictive power to predict document relevance. Second, besides retrieving documents according to their predicted relevance, it also retrieves incoming documents that are considered good training examples. Third, it can dynamically adjust the dissemination threshold throughout the filtering process so as to maintain a good filtering performance in a fully interactive environment. We have conducted experiments on three document corpora, namely, Associated Press, Foreign Broadcast Information Service, and Wall Street Journal to compare the performance of our REPGER algorithm with two existing on-line learning algorithms. The results demonstrate that our REPGER algorithm gives better performance most of the time. Comparison with the TREC (Text Retrieval Conference) adaptive text filtering track participants was also made. The result shows that our REPGER algorithm is comparable to them.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00213
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 72
    Electronic Resource
    Electronic Resource
    Agent Reasoning Mechanism for Long–Term Coalitions Based on Decision Making and Trust (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We address long–term coalitions that are formed of both customer and vendor agents. We present a coalition formation mechanism designed at the agent level as a decision problem. The proposed mechanism is analyzed at both system and agent levels. Our results show that the coalition formation mechanism is beneficial for both the system—it reaches an equilibrium state—and for the agents—their gains highly increase over time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.t01-1-00205
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 73
    Electronic Resource
    Electronic Resource
    Architectural Components of Information–Sharing Societies (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Two similar multi–agent systems have been designed to address the issue of information sharing within a multi–agent system. This paper examines the architectural components that have been added to our information–sharing societies, ACORN and MP3. Through this exploration, we conclude that these components and their underlying concepts can be added to other information–retrieval societies.ACORN consists of a set of information–sharing locations referred to as cafés. Cafés are defined as meeting locations for like–minded agents. Like–minded agents are defined as agents that share a common set of interests. As an example, a café may contain agents that are interested in information relating to cars. A dynamic café clustering method is developed. The performance evaluation of the proposed structure for the café is presented. The concept of a fat/thin agent architecture is introduced. This agent architecture allows for minimizing network traffic as agents traverse the network in search of or distribution of knowledge. The directory server component is presented along with its relation to the fat/thin agent architecture. Finally, an anonymity service provider which allows anonymity for users is introduced.The MP3 society exists with the sole purpose of finding MP3s throughout a given network. Through this society, the core design issues of agent verification and agent validation are addressed and solutions are presented through respective interface components.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.t01-1-00208
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 74
    Electronic Resource
    Electronic Resource
    Generate and Repair Machine Translation (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We propose Generate and Repair Machine Translation (GRMT), a constraint–based approach to machine translation that focuses on accurate translation output. GRMT performs the translation by generating a Translation Candidate (TC), verifying the syntax and semantics of the TC and repairing the TC when required. GRMT comprises three modules: Analysis Lite Machine Translation (ALMT), Translation Candidate Evaluation (TCE) and Repair and Iterate (RI). The key features of GRMT are simplicity, modularity, extendibility, and multilinguality.An English–Thai translation system has been implemented to illustrate the performance of GRMT. The system has been developed and run under SWI–Prolog 3.2.8. The English and Thai grammars have been developed based on Head–Driven Phrase Structure Grammar (HPSG) and implemented on the Attribute Logic Engine (ALE). GRMT was tested to generate the translations for a number of sentences/phrases. Examples are provided throughout the article to illustrate how GRMT performs the translation process.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00190
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 75
    Electronic Resource
    Electronic Resource
    Trends in Agent Communication Language (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Agent technology is an exciting and important new way to create complex software systems. Agents blend many of the traditional properties of AI programs—knowledge–level reasoning, flexibility, proactiveness, goal–directedness, and so forth—with insights gained from distributed software engineering, machine learning, negotiation and teamwork theory, and the social sciences. An important part of the agent approach is the principle that agents (like humans) can function more effectively in groups that are characterized by cooperation and division of labor. Agent programs are designed to autonomously collaborate with each other in order to satisfy both their internal goals and the shared external demands generated by virtue of their participation in agent societies. This type of collaboration depends on a sophisticated system of inter–agent communication. The assumption that inter–agent communication is best handled through the explicit use of an agent communication language (ACL) underlies each of the articles in this special issue. In this introductory article, we will supply a brief background and introduction to the main topics in agent communication.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00184
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 76
    Electronic Resource
    Electronic Resource
    Toward A Formalism for Conversation Protocols Using Joint Intention Theory (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Conversation protocols are used to achieve certain goals or to bring about certain states in the world. Therefore, one may identify the landmarks or the states that must be brought about during the goal–directed execution of a protocol. Accordingly, the landmarks, characterized by propositions that are true in the state represented by that landmark, are the most important aspect of a protocol. Families of conversation protocols can be expressed formally as partially ordered landmarks after the landmarks necessary to achieve a goal have been identified. Concrete protocols represented as joint action expressions can, then, be derived from the partially ordered landmarks and executed directly by joint intention interpreters. This approach of applying Joint Intention theory to protocols also supports flexibility in the actions used to get to landmarks, shortcutting protocol execution, automatic exception handling, and correctness criterion for protocols and protocol compositions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00187
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 77
    Electronic Resource
    Electronic Resource
    Reach Exceeds Grasp: Comments on Frawley's “Control and Cross-Domain Mental Computation: Evidence from Language Breakdown” (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00179
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 78
    Electronic Resource
    Electronic Resource
    Mental Computation and Language Breakdown: Clarifications, Extensions, and Responses (2002)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 18 (2002), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper is a response to commentaries on my target paper for Computational Intelligence, “Control and Cross-Domain Mental Computation: Evidence from Language Breakdown.” In this response, I acknowledge certain errors in my initial construal of control and dismiss unwarranted criticisms. I then reexamine both control and certain language disorders in light of the explicitness of cross-domain communication and the visibility of representations to each other. In the end, I reassert the validity of the logic/control (visibility) distinction in mental computation and argue that the contrasts between Specific Language Impairment and Williams syndrome parallel this distinction.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1467-8640.00183
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 79
    Electronic Resource
    Electronic Resource
    Social Mental Shaping: Modelling the Impact of Sociality on the Mental States of Autonomous Agents (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper presents a framework that captures how the social nature of agents that are situated in a multi-agent environment impacts upon their individual mental states. Roles and social relationships provide an abstraction upon which we develop the notion of social mental shaping. This allows us to extend the standard Belief-Desire-Intention model to account for how common social phenomena (e.g. cooperation, collaborative problem-solving and negotiation) can be integrated into a unified theoretical perspective that reflects a fully explicated model of the autonomous agent’s mental state.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00171
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 80
    Electronic Resource
    Electronic Resource
    Letter to the Editor of Computational Intelligence: Issues Concerning Kohanim and Johnson’s “Using Images as a Foundation for Natural Language Processing” (Nov. 2000) (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00173
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 81
    Electronic Resource
    Electronic Resource
    Rule Quality Measures for Rule Induction Systems: Description and Evaluation (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: A rule quality measure is important to a rule induction system for determining when to stop generalization or specialization. Such measures are also important to a rule-based classification procedure for resolving conflicts among rules. We describe a number of statistical and empirical rule quality formulas and present an experimental comparison of these formulas on a number of standard machine learning datasets. We also present a meta-learning method for generating a set of formula-behavior rules from the experimental results which show the relationships between a formula's performance and the characteristics of a dataset. These formula-behavior rules are combined into formula-selection rules that can be used in a rule induction system to select a rule quality formula before rule induction. We will report the experimental results showing the effects of formula-selection on the predictive performance of a rule induction system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00154
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 82
    Electronic Resource
    Electronic Resource
    Rough Mereological Calculi of Granules: A Rough Set Approach To Computation (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Rough Mereology is a paradigm allowing for a synthesis of main ideas of two potent paradigms for reasoning under uncertainty: Fuzzy Set Theory and Rough Set Theory. Approximate reasoning is based in this paradigm on the predicate of being a part to a degree. We present applications of Rough Mereology to the important theoretical idea put forth by Lotfi Zadeh (1996, 1997), i.e., Granularity of Knowledge: We define granules of knowledge by means of the operator of mereological class and we extend the idea of a granule over complex objects like decision rules as well as decision algorithms. We apply these notions and methods in the distributed environment discussing complex problems of knowledge and granule fusion. We express the mechanism of complex granule formation by means of a formal grammar called Synthesis Grammar defined over granules of knowledge, granules of classifying rules, or over granules of classifying algorithms. We finally propose hybrid rough-neural schemes bridging rough and neural computations.[This artic]
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00159
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 83
    Electronic Resource
    Electronic Resource
    Interval Evaluations in the Analytic Hierarchy Process By Possibility Analysis (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Since a pairwise comparison matrix in the Analytic Hierarchy Process (AHP) is based on human intuition, the given matrix will always include inconsistent elements violating the transitivity property. We propose the Interval AHP by which interval weights can be obtained. The widths of the estimated interval weights represent inconsistency in judging data. Since interval weights can be obtained from inconsistent data, the proposed Interval AHP is more appropriate to human judgment. Assuming crisp values in a pairwise comparison matrix, the interval comparisons including the given crisp comparisons can be obtained by applying the Linear Programming (LP) approach. Using an interval preference relation, the Interval AHP for crisp data can be extended to an approach for interval data allowing to express the uncertainty of human judgment in pairwise comparisons.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00163
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 84
    Electronic Resource
    Electronic Resource
    Maintaining Case-Based Reasoners: Dimensions and Directions (2001)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Experience with the growing number of large-scale and long-term case-based reasoning (CBR) applications has led to increasing recognition of the importance of maintaining existing CBR systems. Recent research has focused on case-base maintenance (CBM), addressing such issues as maintaining consistency, preserving competence, and controlling case-base growth. A set of dimensions for case-base maintenance, proposed by Leake and Wilson, provides a framework for understanding and expanding CBM research. However, it also has been recognized that other knowledge containers can be equally important maintenance targets. Multiple researchers have addressed pieces of this more general maintenance problem, considering such issues as how to refine similarity criteria and adaptation knowledge. As with case-base maintenance, a framework of dimensions for characterizing more general maintenance activity, within and across knowledge containers, is desirable to unify and understand the state of the art, as well as to suggest new avenues of exploration by identifying points along the dimensions that have not yet been studied. This article presents such a framework by (1) refining and updating the earlier framework of dimensions for case-base maintenance, (2) applying the refined dimensions to the entire range of knowledge containers, and (3) extending the theory to include coordinated cross-container maintenance. The result is a framework for understanding the general problem of case-based reasoner maintenance (CBRM). Taking the new framework as a starting point, the article explores key issues for future CBRM research.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00140
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 85
    Electronic Resource
    Electronic Resource
    Case-Base Maintenance By Integrating Case-Index Revision and Case-Retention Policies in a Derivational Replay Framework (2001)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This article presents case-base maintenance policies for case index revision and case retention. The policies are formulated in the context of case-based planners performing case adaptation by derivational replay. I implemented these policies on a particular case-based planner and claim that my case-index revision policy improves the accuracy of the retrieval and that the case-retention policy filters redundant cases better than other case-retention policies known from the literature. My claims are validated by empirical validation. It will be seen that there is an interrelation between the two policies that improves the filtering process of the case-retention policy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00145
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 86
    Electronic Resource
    Electronic Resource
    Distributing Case-Base Maintenance: The Collaborative Maintenance Approach (2001)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Case-base maintenance is an important emerging issue for case-base reasoners as they scale up to handle real-world problems in unstable environments. Over time, the contents of a case base may become out of date or inconsistent with the target problem space, and maintenance strategies must be devised to help recognize and repair these problems by deleting, adding, or modifying cases, for example. In this article we describe a maintenance framework called collaborative maintenance (CM), which has been designed to facilitate, monitor, and control the incremental update of live, dynamic case bases. Our approach is novel in that it automatically supports a distributed, interactive maintenance process—users are permitted to recommend case updates, and the collaborative maintenance process ensures that these recommendations are properly reviewed and actioned.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00147
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 87
    Electronic Resource
    Electronic Resource
    Systematic Maintenance of Corporate Experience Repositories (2001)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Experience-based continuous learning is essential for improving products, processes, and technologies in emerging as well as established areas of business and engineering science. This can be facilitated by case-based organizational learning through capturing relevant experience in the form of cases for reuse in a corporate experience repository. For obvious reasons, learning from experience needs to be a permanent endeavor. Thus an organization has to handle a “continuous stream of experience.” Consequently, such an experience repository requires maintenance. This should not simply happen ad hoc but in a systematic manner. To make competent decisions about maintenance, the experience base and its usage have to be analyzed (i.e., evaluated). To improve maintenance itself, it is necessary to learn about it. For this purpose, we identify the relevant tasks for maintaining an experience repository and the responsibilities of the roles involved. Maintenance addresses not only the actual experience in the form of cases but also the conceptual model and the methods, techniques, and tools that are used for filling and updating the experience repository. To support the roles involved in the maintenance tasks, we provide a flexible, practical maintenance and evaluation framework. This framework provides guidance for the roles. The framework can be combined with other approaches from artificial intelligence, knowledge engineering, and software engineering at different levels of detail. For the practical application of the framework, we describe an integrated technical solution for a corporate experience repository that is maintained using our framework. Furthermore, we discuss the empirical validation of the framework and its implementation.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00150
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 88
    Electronic Resource
    Electronic Resource
    Architectural Methodology Based on Intentional Configuration of Behaviors[Address co] (2001)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 17 (2001), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Intelligence has been an object of study for a long time. Different architectures try to capture and reproduce these aspects into artificial systems (or agents), but there is still no agreement on how to integrate them into a general framework. With this objective in mind, we propose an architectural methodology based on the idea of intentional configuration of behaviors. Behavior-producing modules are used as basic control components that are selected and modified dynamically according to the intentions of the agent. These intentions are influenced by the situation perceived, knowledge about the world, and internal variables that monitor the state of the agent. The architectural methodology preserves the emergence of functionality associated with the behavior-based paradigm in the more abstract levels involved in configuring the behaviors. Validation of this architecture is done using a simulated world for mobile robots, in which the agent must deal with various goals such as managing its energy and its well-being, finding targets, and acquiring knowledge about its environment. Fuzzy logic, a topologic map learning algorithm, and activation variables with a propagation mechanism are used to implement the architecture for this agent.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00136
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 89
    Electronic Resource
    Electronic Resource
    Note of Appreciation From the Editors (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00121
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 90
    Electronic Resource
    Electronic Resource
    Realizing Presuppositions in a Montague Grammar-Like Fragment of English (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: A complete analysis of an English sentence includes syntactic, semantic, and pragmatic components. Presupposition belongs to the pragmatic component. How to determine the presuppositions of multiple-clause sentences has been the focus of much work. Projection of clausal presuppositions is one method to determine the presuppositions of multiple-clause sentences. In this paper we present a new approach to the projection problem. Drawing heavily on the theoretical techniques originating with Montague semantics, our system maps sentences of a category-based grammar into a set of expressions of intensional logic: one expression corresponding to the literal interpretation of the sentence and the remaining expressions corresponding to the presuppositions of the sentence. The new approach correctly predicts the presuppositions of a larger range of multiple-clause sentences than previous projection approaches.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00125
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 91
    Electronic Resource
    Electronic Resource
    Interactive, Text-Based Summarization of Multiple Documents (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper describes a system for the summarization of multiple text-only news-like documents. We address two main issues: clustering of documents in order to find the main topics that should be mentioned in the multidocument summary and organization of the information in order to create a summary that presents the information in a logical way and is easy to read. The system is based on a single-document summarizer that uses text-extraction.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00131
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 92
    Electronic Resource
    Electronic Resource
    Temporal Reasoning and Bayesian Networks (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This work examines important issues in probabilistic temporal representation and reasoning using Bayesian networks (also known as belief networks). The representation proposed here utilizes temporal (or dynamic) probabilities to represent facts, events, and the effects of events. The architecture of a belief network may change with time to indicate a different causal context. Probability variations with time capture temporal properties such as persistence and causation. They also capture event interaction, and when the interaction between events follows known models such as the competing risks model, the additive model, or the dominating event model, the net effect of many interacting events on the temporal probabilities can be calculated efficiently. This representation of reasoning also exploits the notion of temporal degeneration of relevance due to information obsolescence to improve the efficiency.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00116
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 93
    Electronic Resource
    Electronic Resource
    On Resolving Conflicts Between Arguments (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Argument systems are based on the idea that one can construct arguments for propositions—structured reasons justifying the belief in a proposition. Using defeasible rules, arguments need not be valid in all circumstances, therefore, it might be possible to construct an argument for a proposition as well as its negation. When arguments support conflicting propositions, one of the arguments must be defeated, which raises the question of which (sub-) arguments can be subject to defeat.In legal argumentation, metarules determine the valid arguments by considering the last defeasible rule of each argument involved in a conflict. Since it is easier to evaluate arguments using their last rules, can a conflict be resolved by considering only the last defeasible rules of the arguments involved?We propose a new argument system where, instead of deriving a defeat relation between arguments, arguments for the defeat of defeasible rules are constructed. This system allows us to determine a set of valid (undefeated) arguments in linear time using an algorithm based on a JTMS, allows conflicts to be resolved using only the last rules of the arguments, allows us to establish a relation with Default Logic, and allows closure properties such as cumulativity to be proved. We propose an extension of the argument system based on a proposal for reasoning by cases in default logic.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00120
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 94
    Electronic Resource
    Electronic Resource
    Updates with Disjunctive Information: From Syntactical and Semantical Perspectives[This paper] (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The possible models approach is a classical minimal change semantics for knowledge base update, which provides an exclusive interpretation for disjunctive information in updates. It has been recognized that the exclusive interpretation for disjunction may be problematic under some circumstances. In this paper, we investigate inclusive interpretations for disjunctions in updates from both syntactical and semantical viewpoints. In particular, we propose two approaches for disjunctive update—the minimal change with exceptions (MCE) and the minimal change with maximal disjunctive inclusions (MCD). Both approaches provide inclusive interpretations for disjunctions in updates, though the first is syntax-based and the second is model-theoretic. We then characterize the MCE and MCD in terms of alternative minimal change criteria and relate them to traditional Katsuno and Mendelzon's update postulates.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00104
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 95
    Electronic Resource
    Electronic Resource
    Integrating Web-Based Documents, Shared Knowledge Bases, and Information Retrieval for User Help (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We describe a prototype system, IKARUS, with which we investigated the potential of integrating web-based documents, shared knowledge bases, and information retrieval for improving knowledge storage and retrieval. As an example, we discuss how to implement both a user manual and an online help system as one system. The following technologies are combined: a web-based design, a frame-based knowledge engine, use of an advanced full-text search engine, and simple techniques to control terminology. We have combined graphical browsing with several unusual forms of text retrieval—for example, to the sentence and paragraph level.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00107
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 96
    Electronic Resource
    Electronic Resource
    Evolving modular networks with genetic algorithms: application to nonlinear time series (2004)
    Oxford, UK : Blackwell Publishing
    Expert systems 21 (2004), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: A key problem of modular neural networks is finding the optimal aggregation of the different subtasks (or modules) of the problem at hand. Functional networks provide a partial solution to this problem, since the inter-module topology is obtained from domain knowledge (functional relationships and symmetries). However, the learning process may be too restrictive in some situations, since the resulting modules (functional units) are assumed to be linear combinations of selected families of functions. In this paper, we present a non-parametric learning approach for functional networks using feedforward neural networks for approximating the functional modules of the resulting architecture; we also introduce a genetic algorithm for finding the optimal intra-module topology (the appropriate balance of neurons for the different modules according to the complexity of their respective tasks). Some benchmark examples from nonlinear time-series prediction are used to illustrate the performance of the algorithm for finding optimal modular network architectures for specific problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.2004.00278.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 97
    Electronic Resource
    Electronic Resource
    Expressing inter-link constraints in OWL knowledge bases (2004)
    Oxford, UK : Blackwell Publishing
    Expert systems 21 (2004), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: In this paper the Web Ontology Language (OWL) is examined to instantiate expert system knowledge bases intended for semantic Web applications. In particular, OWL is analyzed for expressing Unified Modeling Language (UML) representations that have been augmented with propositional logic asserted as inter-link constraints. The motivation is ultimately to provide declarative propositional logic constraints that can be represented in UML and declaratively implemented using OWL and other constructs to realize semantic Web knowledge base repositories and databases to facilitate expert system applications. The results of this paper show that OWL is sufficient for capturing most inter-link constraints asserted on generalization/specialization instances; however, OWL alone is inadequate for representing some inter-link constraints asserted on associations. We propose enhancements to OWL via RDF extensions for the reification of associations into classes. These extensions mitigate all concerns that were identified in OWL as part of this study. The result is increased support of declarative constraint representations, which can be expressed in knowledge bases in the context of the semantic Web.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.2004.00279.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 98
    Electronic Resource
    Electronic Resource
    News (2004)
    Oxford, UK : Blackwell Publishing
    Expert systems 21 (2004), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.2004.00274.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 99
    Electronic Resource
    Electronic Resource
    Diary (2004)
    Oxford, UK : Blackwell Publishing
    Expert systems 21 (2004), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.2004.00275.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 100
    Electronic Resource
    Electronic Resource
    Genetic doping algorithm (GenD): theory and applications (2004)
    Oxford, UK : Blackwell Publishing
    Expert systems 21 (2004), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: This paper describes an evolutionary algorithm, GenD, conceived by Buscema in 1998 at the Centro Ricerche di Scienze della Comunicazione – Semeion in Rome, where it is still successfully used and has been further developed. Unlike classic genetic algorithms, the GenD system maintains an inner instability during evolution, presenting a continuous evolution of the evolution and a natural increase in biodiversity during the progress of the algorithm. The theory which leads to defining the GenD system is outlined. Specific characteristics of GenD, such as the definition of a species-health aware evolutionary law, the use of genetic operators and the adoption of a structured organization of individuals (tribes), are described. In order to measure GenD capabilities, we investigated also different problems, such as that known as the travelling sales person problem, which belongs to the class of full NP problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.2004.00264.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...