ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (44)
  • neural networks  (23)
  • data mining  (13)
  • CSCW  (8)
  • taxonomy
  • wheat
  • Springer  (44)
  • American Meteorological Society
  • 1995-1999  (44)
  • 1990-1994
  • 1985-1989
  • 1965-1969
  • 1955-1959
  • 1999  (44)
  • Computer Science  (44)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    AI & society 13 (1999), S. 357-376 
    ISSN: 1435-5655
    Keywords: Context ; CSCW ; Culture ; Design ; Interface ; Japan ; Work
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The past decade has seen the development of a perspective holding that technology is socially constructed. This paper examines the social construction of one group of technologies: systems for computer-supported cooperative work (CSCW). It describes the design of CSCW in Japan, with particular attention to the influence of culture on the design process. Two case studies are presented to illustrate the argument that culture is an important factor in technology design, despite commonly held assumptions about the neutrality and objectivity of science and technology. The paper further argues that, by looking at CSCW systems as texts which reflect the context of their production and the society from which they come, we may be better able to understand the transformations that operate when these texts are ‘read’ in the contexts of their implementation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Information systems frontiers 1 (1999), S. 259-266 
    ISSN: 1572-9419
    Keywords: data mining ; statistics ; patterns in data ; fitting distributions ; lambda ; beta
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Data mining has, in the past, tended to use simplistic statistical methods (or even none at all). In this paper we show by example how cutting edge (but easy to use and comprehend) statistical methods can yield substantial gains in data mining. The role of statistics in IS/IT (information systems and information technology) in general can be substantial, yielding more nearly optimal performance of problems at the emerging frontiers in all their aspects.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 9 (1999), S. 3-28 
    ISSN: 1572-8641
    Keywords: physical symbols ; formal programs ; neural networks ; designation ; interpretation ; representation ; semantics ; intensional meaning ; extensional meaning ; causal capacities ; emergence ; levels
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract The purpose of this article is to show why consciousness and thought are not manifested in digital computers. Analyzing the rationale for claiming that the formal manipulation of physical symbols in Turing machines would emulate human thought, the article attempts to show why this proved false. This is because the reinterpretation of ‘designation’ and ‘meaning’ to accommodate physical symbol manipulation eliminated their crucial functions in human discourse. Words have denotations and intensional meanings because the brain transforms the physical stimuli received from the microworld into a qualitative, macroscopic representation for consciousness. Lacking this capacity as programmed machines, computers have no representations for their symbols to designate and mean. Unlike human beings in which consciousness and thought, with their inherent content, have emerged because of their organic natures, serial processing computers or parallel distributed processing systems, as programmed electrical machines, lack these causal capacities.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence and law 7 (1999), S. 81-96 
    ISSN: 1572-8382
    Keywords: agents ; user interface metaphors ; agent programming languages ; agent communication languages ; agent protocols ; Hohfeld ; formal theories of rights ; normative structures ; deontic logic ; groupware ; CSCW ; electronic commerce
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Law
    Notes: Abstract Two areas of importance for agents and multiagent systems are investigated: design of agent programming languages, and design of agent communication languages. The paper contributes in the above mentioned areas by demonstrating improved or novel applications for deontic logic and normative reasoning. Examples are taken from computer-supported cooperative work, and electronic commerce.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence and law 7 (1999), S. 115-128 
    ISSN: 1572-8382
    Keywords: analogy ; fuzzy logic ; learning ; legal formalism ; neural networks ; vagueness
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Law
    Notes: Abstract Computational approaches to the law have frequently been characterized as being formalistic implementations of the syllogistic model of legal cognition: using insufficient or contradictory data, making analogies, learning through examples and experiences, applying vague and imprecise standards. We argue that, on the contrary, studies on neural networks and fuzzy reasoning show how AI & law research can go beyond syllogism, and, in doing that, can provide substantial contributions to the law.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence and law 7 (1999), S. 129-151 
    ISSN: 1572-8382
    Keywords: connectionism ; legal philosophy ; legal theory ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Law
    Notes: Abstract This paper examines the use of connectionism (neural networks) in modelling legal reasoning. I discuss how the implementations of neural networks have failed to account for legal theoretical perspectives on adjudication. I criticise the use of neural networks in law, not because connectionism is inherently unsuitable in law, but rather because it has been done so poorly to date. The paper reviews a number of legal theories which provide a grounding for the use of neural networks in law. It then examines some implementations undertaken in law and criticises their legal theoretical naïvete. It then presents a lessons from the implementations which researchers must bear in mind if they wish to build neural networks which are justified by legal theories.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 25 (1999), S. 121-132 
    ISSN: 1573-0409
    Keywords: invariant object recognition ; pattern recognition ; neural networks ; flexible manufacturing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract A small flexible production cell has been built around a selectively compliant articulated robot arm. Moving on a conveyor belt, boxes marked with different labels are presented to the robot in a random order. Using a camera and a vision card, the labels on the boxes are recognized. Each one of the labels can be rotated, translated or scaled. Three different invariant feature extraction methods (signature, invariant moments of Hu and Zernike) are compared. A neural net is used to classify the labels. The task of the SCARA robot is to pick up the moving boxes and to sort them according to their labels.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 24 (1999), S. 43-68 
    ISSN: 1573-0409
    Keywords: learning robots ; system organization ; optimization ; physical equation ; look-ut table ; neural networks ; fuzzy controllers
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract This paper explores a stepwise learning approach based on a system's decomposition into functional subsystems. Two case studies are examined: a visually guided robot that learns to track a maneuvering object, and a robot that learns to use the information from a force sensor in order to put a peg into a hole. These two applications show the features and advantages of the proposed approach: i) the subsystems naturally arise as functional components of the hardware and software; ii) these subsystems are building blocks of the robot behavior and can be combined in several ways for performing various tasks; iii) this decomposition makes it easier to check the performances and detect the cause of a malfunction; iv) only those subsystems for which a satisfactory solution is not available need to be learned; v) the strategy proposed for coordinating the optimization of all subsystems ensures an improvement at the task-level; vi) the overall system's behavior is significantly improved by the stepwise learning approach.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 26 (1999), S. 91-100 
    ISSN: 1573-0409
    Keywords: robots ; neural networks ; adaptiveness ; stability ; approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract An indirect adaptive control approach is developed in this paper for robots with unknown nonlinear dynamics using neural networks (NNs). A key property of the proposed approach is that the actual joint angle values in the control law are replaced by the desired joint angles, angle velocities and accelerators, and the bound on the NN reconstruction errors is assumed to be unknown. Main theoretical results for designing such a neuro-controller are given, and the control performance of the proposed controller is verified with simulation studies.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 25 (1999), S. 43-59 
    ISSN: 1573-0409
    Keywords: PID control ; GAs ; neural networks ; multivariable systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract When genetic algorithms (GAs) are applied for PID parameter tuning, since the PID parameters are adjusted almost randomly, it is possible that the plant will be damaged due to abrupt changes in PID parameters. To solve this problem, a neural network will be used to model the plant and the genetic tuning procedure will be performed on the neural network instead of the plant. After determining the PID parameters in this off-line manner, these gains are then applied to the plant for on-line control. Moreover, considering that the neural network model may not be accurate enough, a method is also proposed for on-line fine-tuning of PID parameters. To show the validity of the proposed method, a seesaw system that has one input and two outputs will be used for experimental evaluation
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 37 (1999), S. 183-233 
    ISSN: 0885-6125
    Keywords: graphical models ; Bayesian networks ; belief networks ; probabilistic inference ; approximate inference ; variational methods ; mean field methods ; hidden Markov models ; Boltzmann machines ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper presents a tutorial introduction to the use of variational methods for inference and learning in graphical models (Bayesian networks and Markov random fields). We present a number of examples of graphical models, including the QMR-DT database, the sigmoid belief network, the Boltzmann machine, and several variants of hidden Markov models, in which it is infeasible to run exact inference algorithms. We then introduce variational methods, which exploit laws of large numbers to transform the original graphical model into a simplified graphical model in which inference is efficient. Inference in the simpified model provides bounds on probabilities of interest in the original model. We describe a general framework for generating variational transformations based on convex duality. Finally we return to the examples and demonstrate how variational algorithms can be formulated in each case.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 37 (1999), S. 131-141 
    ISSN: 0885-6125
    Keywords: neural networks ; read-once formulas ; threshold gates ; sigmoidal gates ; PAC learning ; Vapnik-Chervonenkis dimension
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A neural network is said to be nonoverlapping if there is at most one edge outgoing from each node. We investigate the number of examples that a learning algorithm needs when using nonoverlapping neural networks as hypotheses. We derive bounds for this sample complexity in terms of the Vapnik-Chervonenkis dimension. In particular, we consider networks consisting of threshold, sigmoidal and linear gates. We show that the class of nonoverlapping threshold networks and the class of nonoverlapping sigmoidal networks on n inputs both have Vapnik-Chervonenkis dimension Ω(nlog n). This bound is asymptotically tight for the class of nonoverlapping threshold networks. We also present an upper bound for this class where the constants involved are considerably smaller than in a previous calculation. Finally, we argue that the Vapnik-Chervonenkis dimension of nonoverlapping threshold or sigmoidal networks cannot become larger by allowing the nodes to compute linear functions. This sheds some light on a recent result that exhibited neural networks with quadratic Vapnik-Chervonenkis dimension.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    ISSN: 1432-122X
    Keywords: CSCW ; Groupware ; Teleteaching ; Workflow-Management ; Elektronischer Handel
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 13 (1999), S. 345-364 
    ISSN: 1573-7462
    Keywords: data mining ; document filtering ; exploratory data analysis ; information retrieval ; self-organizing map ; SOM ; text document collection ; WEBSOM
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract New methods that are user-friendly and efficient are needed for guidanceamong the masses of textual information available in the Internet and theWorld Wide Web. We have developed a method and a tool called the WEBSOMwhich utilizes the self-organizing map algorithm (SOM) for organizing largecollections of text documents onto visual document maps. The approach toprocessing text is statistically oriented, computationally feasible, andscalable – over a million text documents have been ordered on a single map.In the article we consider different kinds of information needs and tasksregarding organizing, visualizing, searching, categorizing and filteringtextual data. Furthermore, we discuss and illustrate with examples howdocument maps can aid in these situations. An example is presented wherea document map is utilized as a tool for visualizing and filtering a stream ofincoming electronic mail messages.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 11 (1999), S. 5-13 
    ISSN: 1573-7497
    Keywords: neural networks ; knowledge representation ; structured knowledge reasoning ; connectionism ; symbol processing ; hybrid systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This collection of articles is the first of two parts of a special issue on “Neural Networks and Structured Knowledge.” The contributions to the first part shed some light on the issues of knowledge representation and reasoning with neural networks. Their scope ranges from formal models for mapping discrete structures like graphs or logical formulae onto different types of neural networks, to the construction of practical systems for various types of reasoning. In the second part to follow, the emphasis will be on the extraction of knowledge from neural networks, and on applications of neural networks and structured knowledge to practical tasks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 11 (1999), S. 15-30 
    ISSN: 1573-7497
    Keywords: neural networks ; structured objects ; machine learning ; classification ; similarity ; nearest neighbor
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Labeled graphs are an appropriate and popular representation of structured objects in many domains. If the labels describe the properties of real world objects and their relations, finding the best match between two graphs turns out to be the weakly defined, NP-complete task of establishing a mapping between them that maps similar parts onto each other preserving as much as possible of their overall structural correspondence. In this paper, former approaches of structural matching and constraint relaxation by spreading activation in neural networks and the method of solving optimization tasks using Hopfield-style nets are combined. The approximate matching task is reformulated as the minimization of a quadratic energy function. The design of the approach enables the user to change the parameters and the dynamics of the net so that knowledge about matching preferences is included easily and transparently. In the last section, some examples demonstrate the successful application of this approach in classification and learning in the domain of organic chemistry.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 11 (1999), S. 277-284 
    ISSN: 1573-7497
    Keywords: genetic algorithms ; classification ; data mining
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A common approach to evaluating competing models in a classification context is via accuracy on a test set or on cross-validation sets. However, this can be computationally costly when using genetic algorithms with large datasets and the benefits of performing a wide search are compromised by the fact that estimates of the generalization abilities of competing models are subject to noise. This paper shows that clear advantages can be gained by using samples of the test set when evaluating competing models. Further, that applying statistical tests in combination with Occam's razor produces parsimonious models, matches the level of evaluation to the state of the search and retains the speed advantages of test set sampling.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    ISSN: 1573-7497
    Keywords: discretisation ; data mining ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An introduction to the approaches used to discretise continuous database features is given, together with a discussion of the potential benefits of such techniques. These benefits are investigated by applying discretisation algorithms to two large commercial databases; the discretisations yielded are then evaluated using a simulated annealing based data mining algorithm. The results produced suggest that dramatic reductions in problem size may be achieved, yielding improvements in the speed of the data mining algorithm. However, it is also demonstrated under certain circumstances that the discretisation produced may give an increase in problem size or allow overfitting by the data mining algorithm. Such cases, within which often only a small proportion of the database belongs to the class of interest, highlight the need both for caution when producing discretisations and for the development of more robust discretisation algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 11 (1999), S. 297-304 
    ISSN: 1573-7497
    Keywords: data mining ; rule discovery ; interest measure ; distinctive features ; characteristic rules
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract One strategy for increasing the efficiency of rule discovery in data mining is to target a restricted class of rules, such as exact or almost exact rules, rules with a limited number of conditions, or rules in which each condition, on its own, eliminates a competing outcome class. An algorithm is presented for the discovery of rules in which each condition is a distinctive feature of the outcome class on its right-hand side in the subset of the data set defined by the conditions, if any, which precede it. Such a rule is said to be characteristic for the outcome class. A feature is defined as distinctive for an outcome class if it maximises a well-known measure of rule interest or is unique to the outcome class in the data set. In the special case of data mining which arises when each outcome class is represented by a single instance in the data set, a feature of an object is shown to be distinctive if and only if no other feature is shared by fewer objects in the data set.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Computer supported cooperative work 8 (1999), S. 207-238 
    ISSN: 1573-7551
    Keywords: awareness ; common artefact ; CSCW ; distortion ; notification ; state presentation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The idea of a “common artefact” is a useful metaphor for the design of CSCW systems. Our ACCT model of a common artefact describes structural elements that provide awareness about the work of others. The ACCT model identifies actors, contents, conversations, and tools as the central components of a common artefact, arranged on a shared background. The elements of a common artefact provide both a background visualization of the activity, but also permit dynamic notification of particular events. We explore this process of notification, which is composed of a selection and a presentation stage. We identify the critical factors of the process, in particular we highlight techniques related to temporal and spatial distortion. The framework helps to prepare design decisions of multi-user systems more consciously.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Information retrieval 1 (1999), S. 193-216 
    ISSN: 1573-7659
    Keywords: information retrieval ; text mining ; topic spotting ; text categorization ; knowledge management ; problem decomposition ; machine learning ; neural networks ; probabilistic models ; hierarchical models ; performance evaluation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract With the recent dramatic increase in electronic access to documents, text categorization—the task of assigning topics to a given document—has moved to the center of the information sciences and knowledge management. This article uses the structure that is present in the semantic space of topics in order to improve performance in text categorization: according to their meaning, topics can be grouped together into “meta-topics”, e.g., gold, silver, and copper are all metals. The proposed architecture matches the hierarchical structure of the topic space, as opposed to a flat model that ignores the structure. It accommodates both single and multiple topic assignments for each document. Its probabilistic interpretation allows its predictions to be combined in a principled way with information from other sources. The first level of the architecture predicts the probabilities of the meta-topic groups. This allows the individual models for each topic on the second level to focus on finer discriminations within the group. Evaluating the performance of a two-level implementation on the Reuters-22173 testbed of newswire articles shows the most significant improvement for rare classes.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Journal of network and systems management 7 (1999), S. 105-126 
    ISSN: 1573-7705
    Keywords: ENTERPRISE NETWORKS ; CSCW ; NETWORK AND SYSTEMS MANAGEMENT ; REENGINEERING ; MANAGEMENT PROCESSES
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract With the increasing implementation by networkedmission-critical applications, an enterprise network isbecoming the lifeline of an organization. Massiveinvestments are being made in the modernization of enterprise networks of diverse serviceorganizations, such as telecommunications andhealth-care providers. Organizations need to adapt tochanging business environment, such as the deregulationof telecommunication services. This necessitates a seamlessintegration of business management processes withenterprise network management processes. Hence there isa need for the formulation of new methodologies for there-engineering of management solutions (with focus onintegrated business processes), though most present daysolutions concentrate on the management of networkequipment only. This paper presents a new methodologyfor the reengineering of the management processesfor enterprise networks, based on Computer SupportedCooperative Work (CSCW) techniques.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    ISSN: 1573-7462
    Keywords: CancerLit ; concept spaces ; data mining ; Hopfield net ; information retrieval ; Kohonen net ; medical knowledge ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper discusses several data mining algorithms and techniques thatwe have developed at the University of Arizona Artificial Intelligence Lab.We have implemented these algorithms and techniques into severalprototypes, one of which focuses on medical information developed incooperation with the National Cancer Institute (NCI) and the University ofIllinois at Urbana-Champaign. We propose an architecture for medicalknowledge information systems that will permit data mining across severalmedical information sources and discuss a suite of data mining tools that weare developing to assist NCI in improving public access to and use of theirexisting vast cancer information collections.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 11 (1999), S. 109-127 
    ISSN: 1573-7497
    Keywords: hybrid models ; sequential decision making ; neural networks ; reinforcement learning ; cognitive modeling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In developing autonomous agents, one usually emphasizes only (situated) procedural knowledge, ignoring more explicit declarative knowledge. On the other hand, in developing symbolic reasoning models, one usually emphasizes only declarative knowledge, ignoring procedural knowledge. In contrast, we have developed a learning model CLARION, which is a hybrid connectionist model consisting of both localist and distributed representations, based on the two-level approach proposed in [40]. CLARION learns and utilizes both procedural and declarative knowledge, tapping into the synergy of the two types of processes, and enables an agent to learn in situated contexts and generalize resulting knowledge to different scenarios. It unifies connectionist, reinforcement, and symbolic learning in a synergistic way, to perform on-line, bottom-up learning. This summary paper presents one version of the architecture and some results of the experiments.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 11 (1999), S. 169-186 
    ISSN: 1573-7497
    Keywords: neural networks ; multiple fault diagnosis ; analog circuits
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper presents a neural network system for the diagnosis of analog circuits and shows how the performance of such a system can be affected by the choice of different techniques used by its submodules. In particular we discuss the influence of feature extraction techniques such as Fourier Transforms, Wavelets and Principal Component Analysis. The system uses several different power supplies and as many neural networks “in parallel”. Two different algorithms that can be used to combine the candidate sets produced by each network are also presented. The system is capable of diagnosing multiple faults even if trained on single ones.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 10 (1999), S. 71-84 
    ISSN: 1573-7497
    Keywords: encryption ; chaotic attractors ; neural networks ; symmetric-key
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A new probabilistic symmetric-key encryption scheme based on chaotic-classified properties of Hopfield neural networks is described. In an overstoraged Hopfield Neural Network (OHNN) the phenomenon of chaotic-attractors is well documented and messages in the attraction domain of an attractor are unpredictably related to each other. By performing permutation operations on the neural synaptic matrix, several interesting chaotic-classified properties of OHNN were found and these were exploited in developing a new cryptography technique. By keeping the permutation operation of the neural synaptic matrix as the secret key, we introduce a new probabilistic encryption scheme for a symmetric-key cryptosystem. Security and encryption efficiency of the new scheme are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Information retrieval 1 (1999), S. 151-173 
    ISSN: 1573-7659
    Keywords: linear combination ; fusion ; neural networks ; routing ; performance evaluation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We present a thorough analysis of the capabilities of the linear combination (LC) model for fusion of information retrieval systems. The LC model combines the results lists of multiple IR systems by scoring each document using a weighted sum of the scores from each of the component systems. We first present both empirical and analytical justification for the hypotheses that such a model should only be used when the systems involved have high performance, a large overlap of relevant documents, and a small overlap of nonrelevant documents. The empirical approach allows us to very accurately predict the performance of a combined system. We also derive a formula for a theoretically optimal weighting scheme for combining 2 systems. We introduce d—the difference between the average score on relevant documents and the average score on nonrelevant documents—as a performance measure which not only allows mathematical reasoning about system performance, but also allows the selection of weights which generalize well to new documents. We describe a number of experiments involving large numbers of different IR systems which support these findings.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Computer supported cooperative work 8 (1999), S. 285-293 
    ISSN: 1573-7551
    Keywords: CSCW ; critical theory ; deconstruction ; ideal speech situation ; social action theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The paper discusses Sharrock's and Button's criticism of our attempt to use Habermas' communicative action theory to analyze group work platforms. We demonstrate that they misconstrue our goals of the paper, misinterpret our analysis of Habermas' action types, and misunderstand the concept of critical science. At the end we question the usefulness of these types of debates in furthering CSCW research.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Computer supported cooperative work 8 (1999), S. 147-167 
    ISSN: 1573-7551
    Keywords: CSCW ; electronic commerce ; intermediary ; digital library ; electronic community ; costomer support ; librarians ; notes ; trust
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Many observers consider traditional intermediaries such as brokers, lenders and salespersons anachronisms in a world where consumers can communicate directly with providers of products and services over computer networks. Under the same rubric, information mediators such as journalists, editors, librarians and customer support representatives are being targeted for elimination. Drawing on our ethnographically-informed studies of customer support analysts and librarians, we demonstrate that the expertise and experience of intermediaries is often invisible – to the consumer, to the organization in which these intermediaries work, and even to the intermediaries' managers. The valuable services provided by intermediaries are not made unnecessary by end-user access. We argue for a richer understanding of intermediation, and a reallocation of functions and roles in which “new intermediaries” – people, software or a combination of the two – aggregate, personalize and assure the quality of information.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent information systems 12 (1999), S. 61-73 
    ISSN: 1573-7675
    Keywords: association rules ; knowledge discovery ; data mining
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We consider the problem of finding association rules in a database with binary attributes. Most algorithms for finding such rules assume that all the data is available at the start of the data mining session. In practice, the data in the database may change over time, with records being added and deleted. At any given time, the rules for the current set of data are of interest. The naive, and highly inefficient, solution would be to rerun the association generation algorithm from scratch following the arrival of each new batch of data. This paper describes the Borders algorithm, which provides an efficient method for generating associations incrementally, from dynamically changing databases. Experimental results show an improved performance of the new algorithm when compared with previous solutions to the problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent information systems 13 (1999), S. 195-234 
    ISSN: 1573-7675
    Keywords: data mining ; knowledge discovery ; machine learning ; knowledge representation ; attribute-oriented generalization ; domain generalization graphs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Attribute-oriented generalization summarizes the information in a relational database by repeatedly replacing specific attribute values with more general concepts according to user-defined concept hierarchies. We introduce domain generalization graphs for controlling the generalization of a set of attributes and show how they are constructed. We then present serial and parallel versions of the Multi-Attribute Generalization algorithm for traversing the generalization state space described by joining the domain generalization graphs for multiple attributes. Based upon a generate-and-test approach, the algorithm generates all possible summaries consistent with the domain generalization graphs. Our experimental results show that significant speedups are possible by partitioning path combinations from the DGGs across multiple processors. We also rank the interestingness of the resulting summaries using measures based upon variance and relative entropy. Our experimental results also show that these measures provide an effective basis for analyzing summary data generated from relational databases. Variance appears more useful because it tends to rank the less complex summaries (i.e., those with few attributes and/or tuples) as more interesting.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 10 (1999), S. 201-210 
    ISSN: 1573-773X
    Keywords: neural networks ; learning ; minimal distance methods ; similarity-based methods ; machine learning ; interpretation of neural functions ; classification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Multilayer Perceptrons (MLPs) use scalar products to compute weighted activation of neurons providing decision borders using combinations of soft hyperplanes. The weighted fun-in activation function may be replaced by a distance function between the inputs and the weights, offering a natural generalization of the standard MLP model. Non-Euclidean distance functions may also be introduced by normalization of the input vectors into an extended feature space. Both approaches influence the shapes of decision borders dramatically. An illustrative example showing these changes is provided.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 10 (1999), S. 211-222 
    ISSN: 1573-773X
    Keywords: constraint satisfaction ; Hopfield network ; neural networks ; optimization ; relaxation procedure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract When solving an optimization problem with a Hopfield network, a solution is obtained after the network is relaxed to an equilibrium state. The relaxation process is an important step in achieving a solution. In this paper, a new procedure for the relaxation process is proposed. In the new procedure, the amplified signal received by a neuron from other neurons is treated as the target value for its activation (output) value. The activation of a neuron is updated directly based on the difference between its current activation and the received target value, without using the updating of the input value as an intermediate step. A relaxation rate is applied to control the updating scale for a smooth relaxation process. The new procedure is evaluated and compared with the original procedure in the Hopfield network through simulations based on 200 randomly generated instances of the 10-city traveling salesman problem. The new procedure reduces the error rate by 34.6% and increases the percentage of valid tours by 194.6% as compared with the original procedure.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 9 (1999), S. 257-269 
    ISSN: 1573-773X
    Keywords: detectors ; detection and false alarm probabilities ; importance sampling techniques ; Monte Carlo simulations ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Often, Neural Networks are involved in binary detectors of communication, radar or sonar systems. The design phase of a neural network detector usually requires the application of Monte Carlo trials in order to estimate some performance parameters. The classical Monte Carlo method is suitable to estimate high event probabilities (higher than 0.01), but not suitable to estimate very low event probabilities (say, 10−5 or less). For estimations of very low false alarm probabilities (or error probabilities), a modified Monte Carlo technique, the so-called Importance Sampling (IS) technique, is considered in this paper; some topics are developed, such as optimal and suboptimal IS probability density functions (biasing density functions), control parameters and new algorithms for the minimization of the estimator error. The main novelty of this paper is the application of an efficient IS technique on neural networks, drastically reducing the number of patterns required for testing events of low probability. As a practical application, the IS technique is applied to a neural detector on a radar (or sonar) system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 9 (1999), S. 279-292 
    ISSN: 1573-773X
    Keywords: cluster analysis ; neural networks ; shell detection
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper presents a novel class of neural networks which can be trained in an unsupervised manner to detect a mixture of hyperellipsoidal shells and/or segments of hyperellipsoidal shells. This approach is computationally and implementationally simpler than other clustering algorithms that have been suggested for this purpose. Experimental results on several data sets are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 9 (1999), S. 221-227 
    ISSN: 1573-773X
    Keywords: dynamical equilibrium ; walking robots ; neural networks ; Levenberg-Marquardt's rules
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A neural network model is proposed as a means of controlling the dynamical equilibrium of a walking bipedal robot. As a criterion to determine the stability of such a robot in relation with the organization of the sensorimotor system, we have been making use of the ZMP (Zero Momentum Point). Simulations are used to check the convergence of the algorithm. In the generalization phase, it is shown that the neural network has the ability to stabilise the robot for motions which have not previously been learned. An extended model is proposed, which seeks to closely inspect the physiology of the cerebellar cortex.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Journal of systems integration 9 (1999), S. 167-185 
    ISSN: 1573-8787
    Keywords: flexibility ; complexity ; systems approach ; taxonomy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper we present a taxonomy of manufacturing problems, labeled in a general sense as Design, Production, or Distribution problems. One or more basic systems concepts, such as complexity and adaptation, attach themselves to each such problems. By combining the hierarchical Design—Production—Distribution idea with system concepts, we establish the fact that there is, indeed, a significant systems component to most problems of modern manufacturing.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Virtual reality 4 (1999), S. 4-14 
    ISSN: 1434-9957
    Keywords: CSCW ; Shared spaces ; Chance encounters ; BSCW ; Active Worlds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract New ways of working, as exemplified by distance learning, telecommuting and the virtual organisation, are growing in popularity. This paper concerns itself with the role that 3D virtual environments can play in assisting such collaborative working. Specifically,chance encounters have been shown to be important in collaboration, that is, encounters that are not pre-arranged by its participants. There are a number of tools to facilitate encounters online, but these create new problems. It is argued that 3D shared spaces can assist in the management of chance encounters, allowing them to create a situation similar to that found in the traditional workplace, in which tasks and content are situated inlocales. If shared 3D spaces are to have utility for computing in general, rather than specific applications, it is suggested that this may be in such spatial management of encounters. An example, in which Active Worlds is employed as an interface to Basic Support for Cooperative Working (BSCW) content is described. This content creates the motivation for users to be within the space, and thus available for chance encounters with other users; their nature and extent of being spatially coordinated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Computational optimization and applications 12 (1999), S. 53-79 
    ISSN: 1573-2894
    Keywords: support vector machines ; linear programming ; classification ; data mining ; machine learning.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We examine the problem of how to discriminate between objects of three or more classes. Specifically, we investigate how two-class discrimination methods can be extended to the multiclass case. We show how the linear programming (LP) approaches based on the work of Mangasarian and quadratic programming (QP) approaches based on Vapnik's Support Vector Machine (SVM) can be combined to yield two new approaches to the multiclass problem. In LP multiclass discrimination, a single linear program is used to construct a piecewise-linear classification function. In our proposed multiclass SVM method, a single quadratic program is used to construct a piecewise-nonlinear classification function. Each piece of this function can take the form of a polynomial, a radial basis function, or even a neural network. For the k 〉 2-class problems, the SVM method as originally proposed required the construction of a two-class SVM to separate each class from the remaining classes. Similarily, k two-class linear programs can be used for the multiclass problem. We performed an empirical study of the original LP method, the proposed k LP method, the proposed single QP method and the original k QP methods. We discuss the advantages and disadvantages of each approach.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Autonomous robots 7 (1999), S. 57-75 
    ISSN: 1573-7527
    Keywords: sensor-based manipulators ; multi-goal reaching tasks ; reinforcement learning ; neural networks ; differential inverse kinematics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Our work focuses on making an autonomous robot manipulator learn suitable collision-free motions from local sensory data while executing high-level descriptions of tasks. The robot arm must reach a sequence of targets where it undertakes some manipulation. The robot manipulator has a sonar sensing skin covering its links to perceive the obstacles in its surroundings. We use reinforcement learning for that purpose, and the neural controller acquires appropriate reaction strategies in acceptable time provided it has some a priori knowledge. This knowledge is specified in two main ways: an appropriate codification of the signals of the neural controller—inputs, outputs and reinforcement—and decomposition of the learning task. The codification facilitates the generalization capabilities of the network as it takes advantage of inherent symmetries and is quite goal-independent. On the other hand, the task of reaching a certain goal position is decomposed into two sequential subtasks: negotiate obstacles and move to goal. Experimental results show that the controller achieves a good performance incrementally in a reasonable time and exhibits high tolerance to failing sensors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Data mining and knowledge discovery 3 (1999), S. 197-217 
    ISSN: 1573-756X
    Keywords: binary decision tree ; classification ; data mining ; entropy ; Gini index ; impurity ; optimal splitting
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields the minimum impurity measure. For binary trees (L = 2) when there are just two classes a short-cut search is possible that is linear in n, the number of distinct values of the attribute. For the general case in which the number of classes, k, may be greater than two, Burshtein et al. have shown that the optimal partition satisfies a condition that involves the existence of 2 L hyperplanes in the class probability space. We derive a property of the optimal partition for concave impurity measures (including in particular the Gini and entropy impurity measures) in terms of the existence ofL vectors in the dual of the class probability space, which implies the earlier condition. Unfortunately, these insights still do not offer a practical search method when n and k are large, even for binary trees. We therefore present a new heuristic search algorithm to find a good partition. It is based on ordering the attribute's values according to their principal component scores in the class probability space, and is linear in n. We demonstrate the effectiveness of the new method through Monte Carlo simulation experiments and compare its performance against other heuristic methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Data mining and knowledge discovery 3 (1999), S. 219-225 
    ISSN: 1573-756X
    Keywords: data mining ; knowledge discovery ; churn prediction application ; predictive modeling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We describe CHAMP (CHurn Analysis, Modeling, and Prediction), an automated system for modeling cellular customer behavior on a large scale. Using historical data from GTE's data warehouse for cellular phone customers, every month CHAMP identifies churn factors for several geographic regions and updates models to generate churn scores predicting who is likely to churn within the near future. CHAMP is capable of developing customized monthly models and churn scores for over one hundred GTE cellular phone markets totaling over 5 million customers.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Data mining and knowledge discovery 3 (1999), S. 237-261 
    ISSN: 1573-756X
    Keywords: data mining ; parallel processing ; classification ; scalability ; decision trees
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Classification decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud detection, etc. Highly parallel algorithms for constructing classification decision trees are desirable for dealing with large data sets in reasonable amount of time. Algorithms for building classification decision trees have a natural concurrency, but are difficult to parallelize due to the inherent dynamic nature of the computation. In this paper, we present parallel formulations of classification decision tree learning algorithm based on induction. We describe two basic parallel formulations. One is based on Synchronous Tree Construction Approach and the other is based on Partitioned Tree Construction Approach. We discuss the advantages and disadvantages of using these methods and propose a hybrid method that employs the good features of these methods. We also provide the analysis of the cost of computation and communication of the proposed hybrid method. Moreover, experimental results on an IBM SP-2 demonstrate excellent speedups and scalability.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Data mining and knowledge discovery 3 (1999), S. 291-314 
    ISSN: 1573-756X
    Keywords: association rules ; data mining ; data skewness ; workload balance ; parallel mining ; parallel computing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Association rule mining is an important new problem in data mining. It has crucial applications in decision support and marketing strategy. We proposed an efficient parallel algorithm for mining association rules on a distributed share-nothing parallel system. Its efficiency is attributed to the incorporation of two powerful candidate set pruning techniques. The two techniques, distributed and global prunings, are sensitive to two data distribution characteristics: data skewness and workload balance. The prunings are very effective when both the skewness and balance are high. We have implemented FPM on an IBM SP2 parallel system. The performance studies show that FPM outperforms CD consistently, which is a parallel version of the representative Apriori algorithm (Agrawal and Srikant, 1994). Also, the results have validated our observation on the effectiveness of the two pruning techniques with respect to the data distribution characteristics. Furthermore, it shows that FPM has nice scalability and parallelism, which can be tuned for different business applications.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...