\begin{thebibliography}{10}

\bibitem{rocprovost1}
F.~Provost and T.~Fawcett, ``Robust {C}lassification for {I}mprecise
  {E}nvironments,'' {\em Machine Learning}, vol.~42/3, pp.~203--231, 2001.

\bibitem{fawcett}
T.~Fawcett and F.~Provost, ``{C}ombining {D}ata {M}ining and {M}achine
  {L}earning for {E}ffective {U}ser {P}rofile,'' in {\em Proceedings of the 2nd
  International Conference on Knowledge Discovery and Data Mining}, (Portland,
  OR), pp.~8--13, AAAI, 1996.

\bibitem{ezawa}
J.~Ezawa, K., M.~Singh, and W.~Norton, S., ``Learning {G}oal {O}riented
  {B}ayesian {N}etworks for {T}elecommunications {R}isk {M}anagement,'' in {\em
  Proceedings of the International Conference on Machine Learning, ICML-96},
  (Bari, Italy), pp.~139--147, Morgan Kauffman, 1996.

\bibitem{lewis}
D.~Lewis and J.~Catlett, ``{H}eterogeneous {U}ncertainity {S}ampling for
  {S}upervised {L}earning,'' in {\em Proceedings of the Eleventh International
  Conference of Machine Learning}, (San Francisco, CA), pp.~148--156, Morgan
  Kaufmann, 1994.

\bibitem{dumais}
S.~Dumais, J.~Platt, D.~Heckerman, and M.~Sahami, ``Inductive {L}earning
  {A}lgorithms and {R}epresentations for {Text} {C}ategorization,'' in {\em
  Proceedings of the Seventh International Conference on Information and
  Knowledge Management.}, pp.~148--155, 1998.

\bibitem{mladenic}
D.~Mladeni\'{c} and M.~Grobelnik, ``Feature {S}election for {Unbalanced}
  {C}lass {D}istribution and {N}aive {B}ayes,'' in {\em Proceedings of the 16th
  International Conference on Machine Learning.}, pp.~258--267, Morgan
  Kaufmann, 1999.

\bibitem{lewiscomp}
D.~Lewis and M.~Ringuette, ``A {C}omparison of {T}wo {L}earning {A}lgorithms
  for {T}ext {C}ategorization,'' in {\em Proceedings of {SDAIR}-94, 3rd Annual
  Symposium on Document Analysis and Information Retrieval}, pp.~81--93, 1994.

\bibitem{cohen95learning}
W.~Cohen, ``Learning to {C}lassify {E}nglish {T}ext with {ILP} {M}ethods,'' in
  {\em Proceedings of the 5th International Workshop on Inductive Logic
  Programming}, pp.~3--24, Department of Computer Science, Katholieke
  Universiteit Leuven, 1995.

\bibitem{oil}
M.~Kubat, R.~Holte, and S.~Matwin, ``Machine {L}earning for the {D}etection of
  {O}il {S}pills in {S}atellite {R}adar {I}mages,'' {\em Machine Learning},
  vol.~30, pp.~195--215, 1998.

\bibitem{woods}
K.~Woods, C.~Doss, K.~Bowyer, J.~Solka, C.~Priebe, and P.~Kegelmeyer,
  ``Comparative {E}valuation of {P}attern {R}ecognition {T}echniques for
  {D}etection of {M}icrocalcifications in {M}ammography,'' {\em International
  Journal of Pattern Recognition and Artificial Intelligence}, vol.~7(6),
  pp.~1417--1436, 1993.

\bibitem{swet}
J.~Swets, ``Measuring the {A}ccuracy of {D}iagnostic {S}ystems,'' {\em
  Science}, vol.~240, pp.~1285--1293, 1988.

\bibitem{duda}
R.~Duda, P.~Hart, and D.~Stork, {\em Pattern Classification}.
\newblock Wiley-Interscience, 2001.

\bibitem{brad}
A.~P. Bradley, ``The {U}se of the {A}rea {U}nder the {ROC} {C}urve in the
  {E}valuation of {M}achine {L}earning {A}lgorithms,'' {\em Pattern
  Recognition}, vol.~30(6), pp.~1145--1159, 1997.

\bibitem{sauchi}
S.~Lee, ``Noisy {R}eplication in {S}kewed {B}inary {C}lassification,'' {\em
  Computational Statistics and Data Analysis}, vol.~34, 2000.

\bibitem{pazzani}
M.~Pazzani, C.~Merz, P.~Murphy, K.~Ali, T.~Hume, and C.~Brunk, ``Reducing
  {M}isclassification {C}osts,'' in {\em Proceedings of the Eleventh
  International Conference on Machine Learning}, (San Francisco, CA), Morgan
  Kauffmann, 1994.

\bibitem{meta}
P.~Domingos, ``Metacost: A {G}eneral {M}ethod for {M}aking {C}lassifiers
  {C}ost-sensitive,'' in {\em Proceedings of the Fifth ACM SIGKDD International
  Conference on Knowledge Discovery and Data Mining}, (San Diego, CA),
  pp.~155--164, ACM Press, 1999.

\bibitem{kubat97}
M.~Kubat and S.~Matwin, ``{A}ddressing the {C}urse of {I}mbalanced {T}raining
  {S}ets: {O}ne {S}ided {S}election,'' in {\em Proceedings of the Fourteenth
  International Conference on Machine Learning}, (Nashville, Tennesse),
  pp.~179--186, Morgan Kaufmann, 1997.

\bibitem{nat}
N.~Japkowicz, ``The {C}lass {I}mbalance {P}roblem: {S}ignificance and
  {S}trategies,'' in {\em Proceedings of the 2000 International Conference on
  Artificial Intelligence (IC-AI'2000): Special Track on Inductive Learning},
  (Las Vegas, Nevada), 2000.

\bibitem{ling}
C.~Ling and C.~Li, ``{D}ata {M}ining for {D}irect {M}arketing {P}roblems and
  {S}olutions,'' in {\em Proceedings of the Fourth International Conference on
  Knowledge Discovery and Data Mining (KDD-98)}, (New York, NY), AAAI Press,
  1998.

\bibitem{us}
N.~Chawla, K.~Bowyer, L.~Hall, and P.~Kegelmeyer, ``{SMOTE}: {S}ynthetic
  {M}inority {O}ver-sampling {TE}chnique,'' in {\em International Conference of
  Knowledge Based Computer Systems}, pp.~46--57, National Center for Software
  Technology, Mumbai, India, Allied Press, 2000.

\bibitem{quib}
J.~Quinlan, {\em C4.5: {P}rograms for {M}achine {L}earning}.
\newblock San Mateo, CA: Morgan Kaufmann, 1992.

\bibitem{ripper}
W.~W. Cohen, ``{F}ast {E}ffective {R}ule {I}nduction,'' in {\em Proc. 12th
  International Conference on Machine Learning}, (Lake Tahoe, CA),
  pp.~115--123, Morgan Kaufmann, 1995.

\bibitem{holte2000}
C.~Drummond and R.~Holte, ``{E}xplicitly {R}epresenting {E}xpected {C}ost: {A}n
  {A}lternative to {ROC} {R}epresentation,'' in {\em Proceedings of the Sixth
  ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},
  (Boston), pp.~198--207, ACM, 2000.

\bibitem{turney}
P.~Turney, ``Cost {S}ensitive {B}ibliography.''
  http://ai.iit.nrc.ca/bibiliographies/cost-sensitive.html, 1996.

\bibitem{provost98}
F.~Provost, T.~Fawcett, and R.~Kohavi, ``The {C}ase {A}gainst {A}ccuracy
  {E}stimation for {C}omparing {I}nduction {A}lgorithms,'' in {\em Proceedings
  of the Fifteenth International Conference on Machine Learning}, (Madison,
  WI), pp.~445--453, Morgan Kauffmann, 1998.

\bibitem{tomek}
I.~Tomek, ``Two {M}odifications of {CNN},'' {\em IEEE Transactions on Systems,
  Man and Cybernetics}, vol.~6, pp.~769--772, 1976.

\bibitem{solb}
A.~Solberg and R.~Solberg, ``A {L}arge-{S}cale {E}valuation of {F}eatures for
  {A}utomatic {D}etection of {O}il {S}pills in {ERS} {SAR} {I}mages,'' in {\em
  International Geoscience and Remote Sensing Symposium}, (Lincoln, NE),
  pp.~1484--1486, 1996.

\bibitem{der}
E.~DeRouin, J.~Brown, L.~Fausett, and M.~Schneider, ``Neural {N}etwork
  {T}raining on {U}nequally {R}epresented {C}lasses,'' in {\em Intellligent
  Engineering Systems Through Artificial Neural Networks}, (New York),
  pp.~135--141, ASME Press, 1991.

\bibitem{oddsratio}
C.~van Rijsbergen, D.~Harper, and M.~Porter, ``The {S}election of {G}ood
  {S}earch {T}erms,'' {\em Information Processing and Management}, vol.~17,
  pp.~77--91, 1981.

\bibitem{bunke}
T.~M. Ha and H.~Bunke, ``Off-line, {H}andwritten {N}umeral {R}ecognition by
  {P}erturbation {M}ethod,'' {\em Pattern Analysis and Machine Intelligence},
  vol.~19/5, pp.~535--539, 1997.

\bibitem{cohen}
W.~W. Cohen and Y.~Singer, ``Context-sensitive {L}earning {M}ethods for {T}ext
  {C}ategorization,'' in {\em Proceedings of {SIGIR}-96, 19th {ACM}
  International Conference on Research and Development in Information
  Retrieval} (H.-P. Frei, D.~Harman, P.~Sch{\"{a}}uble, and R.~Wilkinson,
  eds.), (Z{\"{u}}rich, CH), pp.~307--315, ACM Press, New York, US, 1996.

\bibitem{uci}
C.~Blake and C.~Merz, ``{UCI} {R}epository of {M}achine {L}earning {D}atabases
  http://www.ics.uci.edu/$\sim$mlearn/$\sim${MLR}epository.html.'' {D}epartment
  of {I}nformation and {C}omputer {S}ciences, {U}niversity of {C}alifornia,
  {I}rvine, 1998.

\bibitem{estate}
L.~Hall, B.~Mohney, and L.~Kier, ``The {E}lectrotopological {S}tate:
  {S}tructure {I}nformation at the {A}tomic {L}evel for {M}olecular {G}raphs,''
  {\em Journal of Chemical Information and Computer Science}, vol.~31, no.~76,
  1991.

\bibitem{mustafa_tech}
N.~Chawla and L.~Hall, ``Modifying {MUSTAFA} to capture salient data,'' Tech.
  Rep. ISL-99-01, University of South Florida, Computer Science and Eng. Dept.,
  1999.

\bibitem{compu}
J.~O'Rourke, {\em Computational Geometry in C}.
\newblock UK: Cambridge University Press, 1998.

\bibitem{stanfill}
C.~Stanfill and D.~Waltz, ``{T}oward {M}emory-based {R}easoning,'' {\em
  Communications of the ACM}, vol.~29, no.~12, pp.~1213--1228, 1986.

\bibitem{cost}
S.~Cost and S.~Salzberg, ``A {W}eighted {N}earest {N}eighbor {A}lgorithm for
  {L}earning with {S}ymbolic {F}eatures,'' {\em Machine Learning}, vol.~10,
  no.~1, pp.~57--78, 1993.

\end{thebibliography}
