Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,190,170 papers from all fields of science
Search
Sign In
Create Free Account
Test set
Known as:
Holdout method
, Training (disambiguation)
, Dataset (machine learning)
Expand
In many areas of information science, finding predictive relationships from data is a very important task. Initial discovery of relationships is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Array data structure
Artificial intelligence
Cross-validation (statistics)
Data mining
Expand
Broader (1)
Machine learning
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Hybrid Classification System for Uncertain Data
Zhun-ga Liu
,
Q. Pan
,
J. Dezert
,
G. Mercier
IEEE Transactions on Systems, Man, and…
2017
Corpus ID: 1161456
In classification problem, several different classes may be partially overlapped in their borders. The objects in the border are…
Expand
Highly Cited
2014
Highly Cited
2014
Segmentation-free word spotting with exemplar SVMs
Jon Almazán
,
Albert Gordo
,
A. Fornés
,
Ernest Valveny
Pattern Recognition
2014
Corpus ID: 17854204
Highly Cited
2011
Highly Cited
2011
Traffic sign detection and recognition for intelligent vehicle
Long Chen
,
Qingquan Li
,
Ming Li
,
Qingzhou Mao
IEEE Intelligent Vehicles Symposium (IV)
2011
Corpus ID: 14074227
In this paper, we propose a computer vision based system for real-time robust traffic sign detection and recognition, especially…
Expand
Highly Cited
2008
Highly Cited
2008
Class Conditional Nearest Neighbor and Large Margin Instance Selection
E. Marchiori
2008
Corpus ID: 8248481
—The one nearest neighbor ( 1-NN ) rule uses instance proximity followed by class labeling information for classifying new…
Expand
Highly Cited
2008
Highly Cited
2008
Conditional Random Fields for Integrating Local Discriminative Classifiers
Jeremy Morris
,
E. Fosler-Lussier
IEEE Transactions on Audio, Speech, and Language…
2008
Corpus ID: 15739771
Conditional random fields (CRFs) are a statistical framework that has recently gained in popularity in both the automatic speech…
Expand
Highly Cited
2005
Highly Cited
2005
Identifying Non-Referential it: A Machine Learning Approach Incorporating Linguistically Motivated Patterns
Adriane Boyd
,
Whitney Gegg-Harrison
,
D. Byron
Annual Meeting of the Association for…
2005
Corpus ID: 7045889
In this paper, we present a machine learning system for identifying non-referential it. Types of non-referential it are examined…
Expand
Highly Cited
2004
Highly Cited
2004
Nonvolatile memory based on solid electrolytes
M. Kozicki
,
C. Gopalan
,
Muralikrishnan Balakrishnan
,
Mira Park
,
M. Mitkova
Proceedings. IEEE Computational Systems…
2004
Corpus ID: 2884270
Programmable metallization cell (PMC) memory utilizes electrochemical control of nanoscale quantities of metal in thin films of…
Expand
Highly Cited
2002
Highly Cited
2002
Test power reduction through minimization of scan chain transitions
O. Sinanoglu
,
I. Bayraktaroglu
,
A. Orailoglu
Proceedings 20th IEEE VLSI Test Symposium (VTS )
2002
Corpus ID: 7131991
Parallel test application helps reduce the otherwise considerable test times in SOCs; yet its applicability is limited by average…
Expand
Highly Cited
1995
Highly Cited
1995
Bayesian Learning for Neural Networks
Radford M. Neal
1995
Corpus ID: 60809283
Artificial "neural networks" are widely used as flexible models for classification and regression applications, but questions…
Expand
Highly Cited
1995
Highly Cited
1995
Single-View Based Recognition of Faces Rotated in Depth
Thomas Maurer
,
C. Malsburg
1995
Corpus ID: 11534904
We present a method for recognizing objects (faces) on the basis of just one stored view, in spite of rotation in depth. The…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE