• 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 1,552
Next 10 →

Schema abstraction‖ in a multiple-trace memory model

by Douglas L. Hintzman - Psychological Review , 1986
"... A simulation model of episodic memory, MINERVA 2, is applied to the learning of concepts, as represented bythe schema-abstraction task. The model assumes that each experience produces a separate memory trace and that knowledge of abstract oncepts i derived from the pool of episodic traces at the tim ..."
Abstract - Cited by 359 (2 self) - Add to MetaCart
prototype of the category when cued with the category name and to retrieve and disambiguate a category name when cued with a category exemplar. The model successfully predicts basic findings from the schema-abstraction literature (.g., differential forgetting of proto-types and old instances, typicality

A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-three Old and New Classification Algorithms

by Tjen-Sien Lim, WEI-YIN LOH, W. Cohen , 2000
"... . Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classication accuracy, training time, and (in the case of trees) number of leaves. Classication accuracy is measured by mean error rate and mean rank of error rate. Both cr ..."
Abstract - Cited by 234 (8 self) - Add to MetaCart
. Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classication accuracy, training time, and (in the case of trees) number of leaves. Classication accuracy is measured by mean error rate and mean rank of error rate. Both criteria place a statistical, spline-based, algorithm called Polyclass at the top, although it is not statistically signicantly dierent from twenty other algorithms. Another statistical algorithm, logistic regression, is second with respect to the two accuracy criteria. The most accurate decision tree algorithm is Quest with linear splits, which ranks fourth and fth, respectively. Although spline-based statistical algorithms tend to have good accuracy, they also require relatively long training times. Polyclass, for example, is third last in terms of median training time. It often requires hours of training compared to seconds for other algorithms. The Quest and logistic regression algor...

Evaluating Probabilistic Queries over Imprecise Data

by Reynold Cheng - In SIGMOD , 2003
"... Sensors are often employed to monitor continuously changing entities like locations of moving ob-jects and temperature. The sensor readings are reported to a database system, and are subsequently used to answer queries. Due to continuous changes in these values and limited resources (e.g., net-work ..."
Abstract - Cited by 278 (45 self) - Add to MetaCart
-work bandwidth and battery power), the database may not be able to keep track of the actual values of the entities. Queries that use these old values may produce incorrect answers. However, if the degree of uncertainty between the actual data value and the database value is limited, one can place more confidence

The importance of shape in early lexical learning

by B. Smith, S. Jones - Cognitive Development , 1988
"... We ask if certain dimensions of perceptual similarity are weighted more heavily than others in determining word extension. The specific dimensions examined were shape, size, and texture. In four experiments, subjects were asked either to extend a novel count noun to new instances or, in a nonword cl ..."
Abstract - Cited by 235 (31 self) - Add to MetaCart
classification task, to put together objects that go together. The subjects were 2-year-olds, 3-year-olds, and adults. The results of all four experiments indicate that 2- and 3-year-olds and adults all weight shape more heavily than they do size or texture. This observed emphasis on shape, however, depends

Exemplar-based accounts of relations between classification, recognition, and typicality

by Robert M. Nosofsky - Journal of Experimentul Psychology: Learning, Memory, and Cognition , 1988
"... Previously published sets of classification and old-new recognition memory data are reanalyzed within the framework of an exemplar-based generalization model. The key assumption in the model is that, whereas classification decisions are based on the similarity of a probe to exemplars of a target cat ..."
Abstract - Cited by 179 (15 self) - Add to MetaCart
Previously published sets of classification and old-new recognition memory data are reanalyzed within the framework of an exemplar-based generalization model. The key assumption in the model is that, whereas classification decisions are based on the similarity of a probe to exemplars of a target

classification

by Bani B Ganguly, Yogesh Loher, M B Agarwal, Immunophenotype Positive For Cd, Rearranged Ig Tcr
"... Age and sex: 28 year(s) old female patient. Previous History: no preleukemia (Fever and weakness since one month) no previous malignant disease no inborn condition of note Organomegaly: no hepatomegaly no splenomegaly no enlarged lymph nodes no central nervous system involvement ..."
Abstract - Add to MetaCart
Age and sex: 28 year(s) old female patient. Previous History: no preleukemia (Fever and weakness since one month) no previous malignant disease no inborn condition of note Organomegaly: no hepatomegaly no splenomegaly no enlarged lymph nodes no central nervous system involvement

Spectral Classification; Old and Contemporary

by Sunetra Giridhar
"... iv ..."
Abstract - Add to MetaCart
Abstract not found

Boosting for transfer learning

by Wenyuan Dai, Qiang Yang, Gui-rong Xue, Yong Yu - In Proceedings of the 24th International Conference on Machine Learning, ICML ’07 , 2007
"... Traditional machine learning makes a ba-sic assumption: the training and test data should be under the same distribution. However, in many cases, this identical-distribution assumption does not hold. The assumption might be violated when a task from one new domain comes, while there are only labeled ..."
Abstract - Cited by 161 (13 self) - Add to MetaCart
AdaBoost allows users to utilize a small amount of newly labeled data to leverage the old data to construct a high-quality classification model for the new data. We show that this method can allow us to learn an accurate model using only a tiny amount of new data and a large amount of old data, even when the new

Semi-Supervised Morphosyntactic Classification of Old Icelandic

by Kryztof Urban, Timothy R. Tangherlini, Peter M. Broadwell , 2014
"... We present IceMorph, a semi-supervised morphosyntactic analyzer of Old Icelandic. In addition to machine-read corpora and dictionaries, it applies a small set of declension prototypes to map corpus words to dictionary entries. A web-based GUI allows expert users to modify and augment data through an ..."
Abstract - Add to MetaCart
We present IceMorph, a semi-supervised morphosyntactic analyzer of Old Icelandic. In addition to machine-read corpora and dictionaries, it applies a small set of declension prototypes to map corpus words to dictionary entries. A web-based GUI allows expert users to modify and augment data through

Security Classification

by Stochastic Differential Games, Narar *ave It *camrlgcuoosalbo~otts, Differential Games, Y. C. Ho , 1972
"... 1bIvlale-of feglneerile old Applied tbpsios ..."
Abstract - Add to MetaCart
1bIvlale-of feglneerile old Applied tbpsios
Next 10 →
Results 1 - 10 of 1,552
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