IDEAS home Printed from https://ideas.repec.org/a/eee/jmvana/v81y2002i1p28-46.html
   My bibliography  Save this article

An Almost Surely Optimal Combined Classification Rule

Author

Listed:
  • Mojirsheibani, Majid

Abstract

We propose a data-based procedure for combining a number of individual classifiers in order to construct more effective classification rules. Under some regularity conditions, the resulting combined classifier turns out to be almost surely superior to each of the individual classifiers. Here, superiority means lower misclassification error rate.

Suggested Citation

  • Mojirsheibani, Majid, 2002. "An Almost Surely Optimal Combined Classification Rule," Journal of Multivariate Analysis, Elsevier, vol. 81(1), pages 28-46, April.
    • Handle: RePEc:eee:jmvana:v:81:y:2002:i:1:p:28-46
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0047-259X(01)91990-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Marta Horvath & Gábor Lugosi, 1996. "A data-dependent skeleton estimate and a scale-sensitive dimension for classification," Economics Working Papers 199, Department of Economics and Business, Universitat Pompeu Fabra.
    2. Mojirsheibani, M., 1997. "A consistent combined classification rule," Statistics & Probability Letters, Elsevier, vol. 36(1), pages 43-47, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hothorn, Torsten & Lausen, Berthold, 2005. "Bundling classifiers by bagging trees," Computational Statistics & Data Analysis, Elsevier, vol. 49(4), pages 1068-1078, June.
    2. Cholaquidis, Alejandro & Fraiman, Ricardo & Kalemkerian, Juan & Llop, Pamela, 2016. "A nonlinear aggregation type classifier," Journal of Multivariate Analysis, Elsevier, vol. 146(C), pages 269-281.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mojirsheibani, Majid, 2001. "An iterated classification rule based on auxiliary pseudo-predictors," Computational Statistics & Data Analysis, Elsevier, vol. 38(2), pages 125-138, December.
    2. Esteve, Miriam & Aparicio, Juan & Rodriguez-Sala, Jesus J. & Zhu, Joe, 2023. "Random Forests and the measurement of super-efficiency in the context of Free Disposal Hull," European Journal of Operational Research, Elsevier, vol. 304(2), pages 729-744.
    3. Kohler, Michael & Máthé, Kinga & Pintér, Márta, 2002. "Prediction from Randomly Right Censored Data," Journal of Multivariate Analysis, Elsevier, vol. 80(1), pages 73-100, January.
    4. Camerlenghi, F. & Capasso, V. & Villa, E., 2014. "On the estimation of the mean density of random closed sets," Journal of Multivariate Analysis, Elsevier, vol. 125(C), pages 65-88.
    5. Hothorn, Torsten & Lausen, Berthold, 2005. "Bundling classifiers by bagging trees," Computational Statistics & Data Analysis, Elsevier, vol. 49(4), pages 1068-1078, June.
    6. Devroye, Luc & Györfi, Laszlo & Krzyzak, Adam, 1998. "The Hilbert Kernel Regression Estimate," Journal of Multivariate Analysis, Elsevier, vol. 65(2), pages 209-227, May.
    7. Kohler, Michael, 1999. "Universally Consistent Regression Function Estimation Using Hierarchial B-Splines," Journal of Multivariate Analysis, Elsevier, vol. 68(1), pages 138-164, January.
    8. Richard A. Berk, 2006. "An Introduction to Ensemble Methods for Data Analysis," Sociological Methods & Research, , vol. 34(3), pages 263-295, February.
    9. Fischer, Aurélie, 2010. "Quantization and clustering with Bregman divergences," Journal of Multivariate Analysis, Elsevier, vol. 101(9), pages 2207-2221, October.
    10. Mojirsheibani, Majid, 2000. "A kernel-based combined classification rule," Statistics & Probability Letters, Elsevier, vol. 48(4), pages 411-419, July.
    11. Boumaza, Rachid, 2004. "Discriminant analysis with independently repeated multivariate measurements: an L2 approach," Computational Statistics & Data Analysis, Elsevier, vol. 47(4), pages 823-843, November.
    12. Biau, Gérard & Devroye, Luc, 2005. "Density estimation by the penalized combinatorial method," Journal of Multivariate Analysis, Elsevier, vol. 94(1), pages 196-208, May.
    13. Narayanaswamy Balakrishnan & Majid Mojirsheibani, 2015. "A simple method for combining estimates to improve the overall error rates in classification," Computational Statistics, Springer, vol. 30(4), pages 1033-1049, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jmvana:v:81:y:2002:i:1:p:28-46. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.