• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 7,072
Next 10 →

Object-Oriented Programming Instance vs Class Attributes

by Walter Cazzola, Walter Cazzola, Oop Pt, Walter Cazzola
"... instance vs class attributes ..."
Abstract - Add to MetaCart
instance vs class attributes

First-class Attribute Grammars

by Oege De Moor, Kevin Backhouse, S. Doaitse Swierstra - Informatica , 2000
"... This paper is a contribution to the ongoing quest for modular descriptions of language processors, with the specific aim of rapidly prototyping domain-specific languages [21]. Some might argue that this problem was solved in the eighties, with the development of a proliferation of language processor ..."
Abstract - Cited by 22 (7 self) - Add to MetaCart
processors based on attribute grammars [11, 15, 22]. Others might argue that functional programming languages such as ML are adequate for the purpose, without any further extensions. We believe that functional programming languages do not o#er enough specialised support for implementing compilers. However

Estimating Attributes: Analysis and Extensions of RELIEF

by Igor Kononenko , 1994
"... . In the context of machine learning from examples this paper deals with the problem of estimating the quality of attributes with and without dependencies among them. Kira and Rendell (1992a,b) developed an algorithm called RELIEF, which was shown to be very efficient in estimating attributes. Origi ..."
Abstract - Cited by 474 (25 self) - Add to MetaCart
. Original RELIEF can deal with discrete and continuous attributes and is limited to only two-class problems. In this paper RELIEF is analysed and extended to deal with noisy, incomplete, and multi-class data sets. The extensions are verified on various artificial and one well known real-world problem. 1

Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm

by Nick Littlestone - Machine Learning , 1988
"... learning Boolean functions, linear-threshold algorithms Abstract. Valiant (1984) and others have studied the problem of learning various classes of Boolean functions from examples. Here we discuss incremental learning of these functions. We consider a setting in which the learner responds to each ex ..."
Abstract - Cited by 773 (5 self) - Add to MetaCart
learning Boolean functions, linear-threshold algorithms Abstract. Valiant (1984) and others have studied the problem of learning various classes of Boolean functions from examples. Here we discuss incremental learning of these functions. We consider a setting in which the learner responds to each

Large margin methods for structured and interdependent output variables

by Ioannis Tsochantaridis, Thorsten Joachims, Thomas Hofmann, Yasemin Altun - JOURNAL OF MACHINE LEARNING RESEARCH , 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract - Cited by 624 (12 self) - Add to MetaCart
the complementary issue of designing classification algorithms that can deal with more complex outputs, such as trees, sequences, or sets. More generally, we consider problems involving multiple dependent output variables, structured output spaces, and classification problems with class attributes. In order

Discretization Algorithm that Uses Class-Attribute Interdependence Maximization

by Lukasz Kurgan, Krzysztof J. Cios - Proc. of the 2001 International Conference on Artificial Intelligence (ICAI-2001): Las Vegas , 2001
"... Most of the existing machine learning algorithms are able to extract knowledge from databases that store discrete attributes (features). If the attributes are continuous, the algorithms can be integrated with a discretization algorithm that transforms them into discrete attributes. The paper describ ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
describes an algorithm, called CAIM (class-attribute interdependence maximization), for discretization of continuous attributes that is designed to work with supervised learning algorithms. The algorithm maximizes the class-attribute interdependence and, at the same time, generates possibly minimal number

On the optimality of the simple Bayesian classifier under zero-one loss

by Pedro Domingos, Michael Pazzani - MACHINE LEARNING , 1997
"... The simple Bayesian classifier is known to be optimal when attributes are independent given the class, but the question of whether other sufficient conditions for its optimality exist has so far not been explored. Empirical results showing that it performs surprisingly well in many domains containin ..."
Abstract - Cited by 818 (27 self) - Add to MetaCart
The simple Bayesian classifier is known to be optimal when attributes are independent given the class, but the question of whether other sufficient conditions for its optimality exist has so far not been explored. Empirical results showing that it performs surprisingly well in many domains

Error and attack tolerance of complex networks

by Réka Albert, Hawoong Jeong, Albert-László Barabási , 2000
"... Many complex systems display a surprising degree of tolerance against errors. For example, relatively simple organisms grow, persist and reproduce despite drastic pharmaceutical or environmental interventions, an error tolerance attributed to the robustness of the underlying metabolic network [1]. C ..."
Abstract - Cited by 1013 (7 self) - Add to MetaCart
Many complex systems display a surprising degree of tolerance against errors. For example, relatively simple organisms grow, persist and reproduce despite drastic pharmaceutical or environmental interventions, an error tolerance attributed to the robustness of the underlying metabolic network [1

Basic objects in natural categories

by Eleanor Rosch, Carolyn B. Mervis, Wayne D. Gray, David M. Johnson, Penny Boyes-braem - COGNITIVE PSYCHOLOGY , 1976
"... Categorizations which humans make of the concrete world are not arbitrary but highly determined. In taxonomies of concrete objects, there is one level of abstraction at which the most basic category cuts are made. Basic categories are those which carry the most information, possess the highest categ ..."
Abstract - Cited by 892 (1 self) - Add to MetaCart
significant numbers of attributes in common, (b) have motor programs which are similar to one another, (c) have similar shapes, and (d) can be identified from averaged shapes of members of the class. The eight experiments of Part II explore implications of the structure of categories. Basic objects are shown

Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,

by ] Richard Hackman , Grec R Oldham , 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract - Cited by 622 (2 self) - Add to MetaCart
A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally
Next 10 →
Results 1 - 10 of 7,072
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University