% Generated by IEEEtran.bst, version: 1.13 (2008/09/30)
\begin{thebibliography}{10}
\providecommand{\url}[1]{#1}
\csname url@samestyle\endcsname
\providecommand{\newblock}{\relax}
\providecommand{\bibinfo}[2]{#2}
\providecommand{\BIBentrySTDinterwordspacing}{\spaceskip=0pt\relax}
\providecommand{\BIBentryALTinterwordstretchfactor}{4}
\providecommand{\BIBentryALTinterwordspacing}{\spaceskip=\fontdimen2\font plus
\BIBentryALTinterwordstretchfactor\fontdimen3\font minus
  \fontdimen4\font\relax}
\providecommand{\BIBforeignlanguage}[2]{{%
\expandafter\ifx\csname l@#1\endcsname\relax
\typeout{** WARNING: IEEEtran.bst: No hyphenation pattern has been}%
\typeout{** loaded for the language `#1'. Using the pattern for}%
\typeout{** the default language instead.}%
\else
\language=\csname l@#1\endcsname
\fi
#2}}
\providecommand{\BIBdecl}{\relax}
\BIBdecl

\bibitem{Frank+Asuncion:2010}
\BIBentryALTinterwordspacing
A.~Frank and A.~Asuncion, ``{UCI} machine learning repository,'' 2010.
  [Online]. Available: \url{http://archive.ics.uci.edu/ml}
\BIBentrySTDinterwordspacing

\bibitem{Hart67}
T.~Cover and P.~Hart, ``Nearest neighbor pattern classification,''
  \emph{Information Theory, IEEE Transactions on}, vol.~13, no.~1, pp. 21--27,
  Jan 1967.

\bibitem{jalali08}
O.~Jalali, T.~Menzies, and M.~Feather, ``Optimizing requirements decisions with
  keys,'' in \emph{Proceedings of the PROMISE 2008 Workshop (ICSE)}, 2008,
  available from \url{http://menzies.us/pdf/08keys.pdf}.

\bibitem{Devi2002}
\BIBentryALTinterwordspacing
V.~S. Devi and M.~N. Murty, ``An incremental prototype set building
  technique,'' \emph{Pattern Recognition}, vol.~35, no.~2, pp. 505 -- 513,
  2002. [Online]. Available:
  \url{http://www.sciencedirect.com/science/article/B6V14-44HT45G-K/2/a27d8d6d%
4a216b97974cfa5cd7947419}
\BIBentrySTDinterwordspacing

\bibitem{Bezdek2001}
J.~Bezdek and L.~Kuncheva, ``{Nearest prototype classifier designs: An
  experimental study},'' \emph{{INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS}},
  vol.~{16}, no.~{12}, pp. {1445--1473}, {DEC} {2001}.

\bibitem{Dasarathy94}
B.~Dasarathy, ``Minimal consistent set (mcs) identification for optimal nearest
  neighbor decision systems design,'' \emph{Systems, Man and Cybernetics, IEEE
  Transactions on}, vol.~24, no.~3, pp. 511--517, Mar 1994.

\bibitem{Li2009}
Y.~Li, M.~Xie, and T.~Goh, ``{A study of project selection and feature
  weighting for analogy based software cost estimation},'' \emph{Journal of
  Systems and Software}, vol.~82, pp. 241--252, 2009.

\bibitem{Bezdek98}
J.~Bezdek, T.~Reichherzer, G.~Lim, and Y.~Attikiouzel, ``Multiple-prototype
  classifier design,'' \emph{Systems, Man, and Cybernetics, Part C:
  Applications and Reviews, IEEE Transactions on}, vol.~28, no.~1, pp. 67--79,
  Feb 1998.

\bibitem{Cano2005}
\BIBentryALTinterwordspacing
J.~R. Cano, F.~Herrera, and M.~Lozano, ``Stratification for scaling up
  evolutionary prototype selection,'' \emph{Pattern Recognition Letters},
  vol.~26, no.~7, pp. 953 -- 963, 2005. [Online]. Available:
  \url{http://www.sciencedirect.com/science/article/B6V15-4DTTHDM-1/2/1c98d61e%
651bcd792d23fce1360b91c9}
\BIBentrySTDinterwordspacing

\bibitem{Garain2008}
U.~Garain, ``Prototype reduction using an artificial immune model,''
  \emph{Pattern Anal. Appl.}, vol.~11, no. 3-4, pp. 353--363, 2008.

\bibitem{Veenman2005}
C.~Veenman and M.~Reinders, ``{The nearest subclass classifier: A compromise
  between the nearest mean and nearest neighbor classifier},'' \emph{{IEEE
  TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE}}, vol.~{27},
  no.~{9}, pp. {1417--1429}, {SEP} {2005}.

\bibitem{García2008}
\BIBentryALTinterwordspacing
S.~García, J.~R. Cano, and F.~Herrera, ``A memetic algorithm for evolutionary
  prototype selection: A scaling up approach,'' \emph{Pattern Recognition},
  vol.~41, no.~8, pp. 2693 -- 2709, 2008. [Online]. Available:
  \url{http://www.sciencedirect.com/science/article/B6V14-4RX06Y7-1/2/af922a53%
032b4fa079170bd319749e2e}
\BIBentrySTDinterwordspacing

\bibitem{Hart68a}
P.~Hart, ``The condensed nearest neighbor rule (corresp.),'' \emph{Information
  Theory, IEEE Transactions on}, vol.~14, no.~3, pp. 515 -- 516, may 1968.

\bibitem{Gates72}
G.~Gates, ``The reduced nearest neighbor rule (corresp.),'' \emph{Information
  Theory, IEEE Transactions on}, vol.~18, no.~3, pp. 431 -- 433, 1972.

\bibitem{lot2010}
\BIBentryALTinterwordspacing
J.~Olvera-López, J.~Carrasco-Ochoa, and J.~Martínez-Trinidad, ``A new fast
  prototype selection method based on clustering,'' \emph{Pattern Analysis
  &amp; Applications}, vol.~13, pp. 131--141, 2010, 10.1007/s10044-008-0142-x.
  [Online]. Available: \url{http://dx.doi.org/10.1007/s10044-008-0142-x}
\BIBentrySTDinterwordspacing

\bibitem{Olvera2010}
J.~Olvera-López, J.~Carrasco-Ochoa, J.~Martínez-Trinidad, and J.~Kittler, ``A
  review of instance selection methods,'' \emph{Artificial Intelligence
  Review}, vol.~34, pp. 133--143, 2010.

\bibitem{FCNN07}
F.~Angiulli, ``{Fast nearest neighbor condensation for large data sets
  classification},'' \emph{{IEEE TRANSACTIONS ON KNOWLEDGE AND DATA
  ENGINEERING}}, vol.~{19}, no.~{11}, pp. {1450--1464}, {NOV} {2007}.

\bibitem{wilson00}
D.~R. Wilson and T.~R. Martinez, ``Reduction techniques for instance-based
  learning algorithms,'' \emph{Machine Learning}, vol.~38, pp. 257--286, 2000.

\bibitem{Ritter75}
G.~Ritter, H.~Woodruff, S.~Lowry, and T.~Isenhour, ``An algorithm for a
  selective nearest neighbor decision rule (corresp.),'' \emph{Information
  Theory, IEEE Transactions on}, vol.~21, no.~6, pp. 665 -- 669, nov 1975.

\bibitem{Wilson72}
D.~L. Wilson, ``Asymptotic properties of nearest neighbor rules using edited
  data,'' \emph{Systems, Man and Cybernetics, IEEE Transactions on}, vol.~2,
  no.~3, pp. 408 -- 421, jul 1972.

\bibitem{Raicharoen05}
T.~Raicharoen and C.~Lursinsap, ``{A divide-and-conquer approach to the
  pairwise opposite class-nearest neighbor (POC-NN) algorithm},''
  \emph{{PATTERN RECOGNITION LETTERS}}, vol.~{26}, no.~{10}, pp. {1554--1567},
  {JUL 15} {2005}.

\bibitem{Tomek76}
I.~TOMEK, ``{EXPERIMENT WITH EDITED NEAREST-NEIGHBOR RULE},'' \emph{{IEEE
  TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS}}, vol.~{6}, no.~{6}, pp.
  {448--452}, {1976}.

\bibitem{Kriegel05}
H.~peter Kriegel, A.~Pryakhin, and M.~Schubert, ``Multi-represented
  knn-classification for large class sets,'' in \emph{10 th Intl. Proc}, 2005.

\bibitem{Brighton2002}
H.~Brighton and C.~Mellish, ``{Advances in instance selection for
  instance-based learning algorithms},'' \emph{{DATA MINING AND KNOWLEDGE
  DISCOVERY}}, vol.~{6}, no.~{2}, pp. {153--172}, {APR} {2002}.

\bibitem{OCM2007}
J.~Arturo Olvera-López, J.~Ariel Carrasco-Ochoa, and J.~Francisco
  Martínez-Trinidad, ``Object selection based on clustering and border
  objects,'' in \emph{Computer Recognition Systems 2}, ser. Advances in
  Intelligent and Soft Computing, M.~Kurzynski, E.~Puchala, M.~Wozniak, and
  A.~Zolnierek, Eds.\hskip 1em plus 0.5em minus 0.4em\relax Springer Berlin /
  Heidelberg, 2007, vol.~45, pp. 27--34.

\bibitem{Carrasco05}
J.~Olvera-Lopez, J.~Carrasco-Ochoa, and J.~Martinez-Trinidad, ``{Sequential
  search for decremental...}'' in \emph{{INTELLIGENT DATA ENGINEERING AND
  AUTOMATED LEARNING IDEAL 2005, PROCEEDINGS}}, ser. {LECTURE NOTES IN COMPUTER
  SCIENCE}, {Gallagher, M and Hogan, J and Maire, F}, Ed., {2005}, vol. {3578},
  pp. {280--285}.

\bibitem{Riquelme03}
J.~Riquelme, J.~Aguilar-Ruiz, and M.~Toro, ``{Finding representative patterns
  with ordered projections},'' \emph{{PATTERN RECOGNITION}}, vol.~{36},
  no.~{4}, pp. {1009--1018}, {APR} {2003}.

\bibitem{Narayan06}
B.~Narayan, C.~Murthy, and S.~Pal, ``{Maxdiff kd-trees for data
  condensation},'' \emph{{PATTERN RECOGNITION LETTERS}}, vol.~{27}, no.~{3},
  pp. {187--200}, {FEB} {2006}.

\bibitem{knn}
R.~O. Duda and P.~E.Hart, \emph{Pattern classification and scene
  analysis}.\hskip 1em plus 0.5em minus 0.4em\relax A Wiley-Interscience
  Publication, New York: Wiley, 1973.

\bibitem{Fayyad1992}
U.~M. Fayyad and K.~B. Irani, ``On the handling of continuous-valued attributes
  in decision tree generation,'' \emph{Mach. Learn.}, vol.~8, pp. 87--102,
  January 1992.

\bibitem{burak}
B.~Turhan, T.~Menzies, A.~B. Bener, and J.~Di~Stefano, ``{On the relative value
  of cross-company and within-company data for defect prediction},''
  \emph{{EMPIRICAL SOFTWARE ENGINEERING}}, vol.~{14}, no.~{5}, pp. {540--578},
  {OCT} {2009}.

\bibitem{Walsh94}
K.~Walsh, J.~Buckleton, and C.~Triggs, ``A practical example of the
  interpretation of glass evidence,'' \emph{Science and Justice}, vol.~36,
  no.~4, pp. 213--218, 1996.

\bibitem{09NAS}
C.~on~Identifying the Needs of the Forensic Sciences Community;Committee~on
  Applied and N.~R.~C. Theoretical~Statistics, \emph{Strengthening Forensic
  Science in the United States: A Path Forward}.\hskip 1em plus 0.5em minus
  0.4em\relax 500 Fifth Street, N.W., Lockbox 285, Washington, DC 20055:
  National Academies Press, 2009.

\bibitem{Karslake09}
E.~Liszewski, S.~Lewis, J.~Siegel, and J.~Goodpaster, ``Characterisation of
  automotive paint clear coats by ultraviolet absorption microspectrophotometry
  with subsequent chemometric analysis,'' \emph{Applied Spectroscopy}, vol.~64,
  no.~10, pp. 1122--1125, 2010.

\bibitem{fastmap}
C.~Faloutsos and K.-I. Lin, ``Fastmap: a fast algorithm for indexing,
  data-mining and visualization of traditional and multimedia datasets,'' in
  \emph{SIGMOD '95: Proceedings of the 1995 ACM SIGMOD international conference
  on Management of data}.\hskip 1em plus 0.5em minus 0.4em\relax New York, NY,
  USA: ACM, 1995, pp. 163--174.

\bibitem{09Zadora}
G.~Zadora and T.~Neocleous, ``{Likelihood ratio model for classification of
  forensic evidence},'' \emph{{ANALYTICA CHIMICA ACTA}}, vol. {642}, no. {1-2,
  Sp. Iss. SI}, pp. {266--278}, {MAY 29} {2009}.

\bibitem{09aZadora}
G.~Zadora, ``{Evaluation of evidence value of glass fragments by likelihood
  ratio and Bayesian Network approaches},'' \emph{{ANALYTICA CHIMICA ACTA}},
  vol. {642}, no. {1-2, Sp. Iss. SI}, pp. {279--290}, {MAY 29} {2009}.

\bibitem{06Aitken}
C.~Aitken, D.~Lucy, G.~Zadora, and J.~Curran, ``{Evaluation of transfer
  evidence for three-level multivariate data with the use of graphical
  models},'' \emph{{COMPUTATIONAL STATISTICS \& DATA ANALYSIS}}, vol.~{50},
  no.~{10}, pp. {2571--2588}, {JUN 20} {2006}.

\bibitem{04Aitken}
C.~Aitken and D.~Lucy, ``{Evaluation of trace evidence in the form of
  multivariate data},'' \emph{{JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES
  C-APPLIED STATISTICS}}, vol.~{53}, no. {Part 1}, pp. {109--122}, {2004}.

\bibitem{02Koons}
R.~Koons and J.~Buscaglia, ``{Interpretation of glass composition measurements:
  the effects of match criteria on discrimination capability},'' \emph{{JOURNAL
  OF FORENSIC SCIENCES}}, vol.~{47}, no.~{3}, pp. {505--512}, {MAY} {2002}.

\bibitem{99Koons}
------, ``{The forensic significance of glass composition and refractive index
  measurements},'' \emph{{JOURNAL OF FORENSIC SCIENCES}}, vol.~{44}, no.~{3},
  pp. {496--503}, {MAY} {1999}.

\bibitem{me07}
T.~Menzies and Y.~Hu, ``Just enough learning (of association rules): The {TAR2}
  treatment learner,'' in \emph{Artificial Intelligence Review}, 2007,
  available from \url{http://menzies.us/pdf/07tar2.pdf}.

\end{thebibliography}
