Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,382,380 papers from all fields of science
Search
Sign In
Create Free Account
Data pre-processing
Known as:
Data preprocessing
Data pre-processing is an important step in the data mining process. The phrase "garbage in, garbage out" is particularly applicable to data mining…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Data mining
Data quality
Feature extraction
Feature selection
Expand
Broader (1)
Machine learning
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Census Data Mining and Data Analysis using WEKA
S. Jagtap
,
S. Vivekanand
arXiv.org
2013
Corpus ID: 15324286
Data mining (also known as knowledge discovery from databases) is the process of extraction of hidden, previously unknown and…
Expand
2013
2013
K-Means for Parallel Architectures Using All-Prefix-Sum Sorting and Updating Steps
Kai J. Kohlhoff
,
V. Pande
,
R. Altman
IEEE Transactions on Parallel and Distributed…
2013
Corpus ID: 206770809
We present an implementation of parallel K-means clustering, called Kps-means, that achieves high performance with near-full…
Expand
2011
2011
Methods and automatic procedures for processing images based on blind evaluation of noise type and characteristics
V. Lukin
,
S. Abramov
,
+5 authors
J. Astola
2011
Corpus ID: 59205605
In many modern applications, methods and algorithms used for image processing require a priori knowledge or estimates of noise…
Expand
Highly Cited
2005
Highly Cited
2005
Categorization Rehab Duwairi Department of Computer Information Systems , Jordan University of Science and Technology , Jordan
R. Duwairi
2005
Corpus ID: 15302159
In this paper, we compare the performance of three classifiers for Arabic text categorization. In particular, the naïve Bayes, k…
Expand
Highly Cited
2004
Highly Cited
2004
Iris recognition using histogram analysis
Robert W. Ives
,
Anthony J. Guidry
,
Delores M. Etter
Conference Record of the Thirty-Eighth Asilomar…
2004
Corpus ID: 46696824
Iris recognition is perhaps the most accurate means of personnel identification due to the uniqueness of the patterns contained…
Expand
Highly Cited
2001
Highly Cited
2001
Music Database Retrieval Based on Spectral Similarity
Cheng Yang
2001
Corpus ID: 1957130
We present an efficient algorithm to retrieve similar music pieces from an audio database. The algorithm tries to capture the…
Expand
Highly Cited
1999
Highly Cited
1999
RoboLog Koblenz: Spatial Agents Implemented in a Logical Expressible Language
Frieder Stolzenburg
,
Oliver Obst
,
Jan Murray
,
B. Bremer
1999
Corpus ID: 8133630
In this paper, we present a multi-layered architecture for spatial and temporal agents. The focus is laid on the declarativity of…
Expand
Highly Cited
1996
Highly Cited
1996
Embedding Technical Analysis Into Neural Network Based Trading Systems
T. Chenoweth
,
Z. Obradovic
,
Sauchi Stephen Lee
Applied Artificial Intelligence
1996
Corpus ID: 12047403
We have recently proposed a promising trading system for the S P 500 index which consists of a feature selection component and a…
Expand
Highly Cited
1989
Highly Cited
1989
Object recognition based on graph matching implemented by a Hopfield-style neural network
W. Li
,
N. Nasrabadi
International Joint Conference on Neural…
1989
Corpus ID: 9560295
A model-based object recognition technique is presented. For each model, distinct features such as curvature points are extracted…
Expand
1983
1983
Low-Order Approximation of Transmission Line Parameters for Frequency-Dependent Models
L. Marti
IEEE Transactions on Power Apparatus and Systems
1983
Corpus ID: 47562781
Frequency-dependent line models are considerably more accurate than constant-parameters models. However, constant-parameters…
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