Search dblp for Publications

export results for "toc:db/journals/ml/ml42.bht:"

 download as .bib file

@article{DBLP:journals/ml/BradfordB01,
  author       = {Jeffrey P. Bradford and
                  Carla E. Brodley},
  title        = {The Effect of Instance-Space Partition on Significance},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {3},
  pages        = {269--286},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007613918580},
  doi          = {10.1023/A:1007613918580},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/BradfordB01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/DhillonM01,
  author       = {Inderjit S. Dhillon and
                  Dharmendra S. Modha},
  title        = {Concept Decompositions for Large Sparse Text Data Using Clustering},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {1/2},
  pages        = {143--175},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007612920971},
  doi          = {10.1023/A:1007612920971},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/DhillonM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/Fisher01,
  author       = {Douglas H. Fisher},
  title        = {Introduction},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {1/2},
  pages        = {5--7},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007620800498},
  doi          = {10.1023/A:1007620800498},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/Fisher01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/FlachL01,
  author       = {Peter A. Flach and
                  Nicolas Lachiche},
  title        = {Confirmation-Guided Discovery of First-Order Rules with Tertius},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {1/2},
  pages        = {61--95},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007656703224},
  doi          = {10.1023/A:1007656703224},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/FlachL01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/Gat01,
  author       = {Yoram Gat},
  title        = {A Learning Generalization Bound with an Application to Sparse-Representation
                  Classifiers},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {3},
  pages        = {233--239},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007605716762},
  doi          = {10.1023/A:1007605716762},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/Gat01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/GroveR01,
  author       = {Adam J. Grove and
                  Dan Roth},
  title        = {Linear Concepts and Hidden Variables},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {1/2},
  pages        = {123--141},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007655119445},
  doi          = {10.1023/A:1007655119445},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/GroveR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/Hofmann01,
  author       = {Thomas Hofmann},
  title        = {Unsupervised Learning by Probabilistic Latent Semantic Analysis},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {1/2},
  pages        = {177--196},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007617005950},
  doi          = {10.1023/A:1007617005950},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/Hofmann01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/Japkowicz01,
  author       = {Nathalie Japkowicz},
  title        = {Supervised Versus Unsupervised Binary-Learning by Feedforward Neural
                  Networks},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {1/2},
  pages        = {97--122},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007660820062},
  doi          = {10.1023/A:1007660820062},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/Japkowicz01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/MeilaH01,
  author       = {Marina Meila and
                  David Heckerman},
  title        = {An Experimental Comparison of Model-Based Clustering Methods},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {1/2},
  pages        = {9--29},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007648401407},
  doi          = {10.1023/A:1007648401407},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/MeilaH01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/ProvostF01,
  author       = {Foster J. Provost and
                  Tom Fawcett},
  title        = {Robust Classification for Imprecise Environments},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {3},
  pages        = {203--231},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007601015854},
  doi          = {10.1023/A:1007601015854},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/ProvostF01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/RatschOM01,
  author       = {Gunnar R{\"{a}}tsch and
                  Takashi Onoda and
                  Klaus{-}Robert M{\"{u}}ller},
  title        = {Soft Margins for AdaBoost},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {3},
  pages        = {287--320},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007618119488},
  doi          = {10.1023/A:1007618119488},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/RatschOM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/Tadic01,
  author       = {Vladislav Tadic},
  title        = {On the Convergence of Temporal-Difference Learning with Linear Function
                  Approximation},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {3},
  pages        = {241--267},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007609817671},
  doi          = {10.1023/A:1007609817671},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/Tadic01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/Zaki01,
  author       = {Mohammed Javeed Zaki},
  title        = {{SPADE:} An Efficient Algorithm for Mining Frequent Sequences},
  journal      = {Mach. Learn.},
  volume       = {42},
  number       = {1/2},
  pages        = {31--60},
  year         = {2001},
  url          = {https://doi.org/10.1023/A:1007652502315},
  doi          = {10.1023/A:1007652502315},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/Zaki01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.