Skip to main content

Advertisement

Log in

A novel network framework using similar-to-different learning strategy

  • Open Forum
  • Published:
AI & SOCIETY Aims and scope Submit manuscript

Abstract

Most of the existing classification techniques concentrate on learning the datasets as a single similar unit, in spite of so many differentiating attributes and complexities involved. However, traditional classification techniques are required to analyze the datasets prior to learning, and if not doing so, they loss their performance in terms of accuracy and AUC. To this end, many of the machine learning problems can be very easily solved just by carefully observing human learning and training nature and then mimicking the same in the machine learning. In response to these issues, we present a comprehensive suite of experiments carefully designed to provide conclusive, reliable, and significant results to the problem of efficient learning. This paper proposes a novel, simple, and effective machine learning paradigm that explicitly exploits this important similar-to-different (S2D) human learning strategy and implements it based on two algorithms (C4.5 and CART) efficiently. The framework not only analyzes the data sets prior to implementation, but also carefully allows classifier to have a systematic study so as to mimic the human training technique designed for efficient learning. Experimental results show that the method outperforms the state-of-the-art methods in terms of learning capability and breaks through the gap between human and machine learning. In fact, the proposed similar-to-different (S2D) strategy may also be useful in efficient learning of real-world complex and high-dimensional data sets, especially which are very typical to learn with traditional classifiers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Asuncion A, Newman D (2007). UCI Repository of machine learning database (School of Information and Computer Science), Irvine, CA: Univ. of California [Online]. Available: http://www.ics.uci.edu/~mlearn/MLRepository.htm

  • Breiman L, Friedman J, Olshen R, Stone C (1984) Classification and regression trees. Wadsworth, Belmont

    MATH  Google Scholar 

  • Çelik S, Topas V (2010) Vocabulary learning strategy use of Turkish EFL learners. Procedia Soc Behav Sci 3:62–71

    Article  Google Scholar 

  • Chawla N, Bowyer K, Kegelmeyer P (2002) SMOTE: synthetic minority over-sampling technique. J Artif Intell Res 16:321–357

    MATH  Google Scholar 

  • Dong ZG, Min Z, Hong JD, Ming ZQ (2008) Hierarchical learning strategy in semantic relation extraction. Inf Process Manag 44:1008–1021

    Article  Google Scholar 

  • Duh K, Fujino A (2012) Flexible sample selection strategies for transfer learning in ranking. Inf Process Manag 48:502–512

    Article  Google Scholar 

  • Eileen AN, Charles XL (2010) Supervised Learning with Minimal Effort, Zaki MJ et al. (Eds), PAKDD 2010, Part II, LNAI 6119, pp 476–487

  • Gil RJ, Martin-Bautista MJ (2012) A novel integrated knowledge support system based on ontology learning: model specification and a case study. Knowl-Based Syst 36:340–352

    Article  Google Scholar 

  • Grana C, Borghesani D, Cucchiara R (2010) Optimized block-based connected components labeling with decision trees. IEEE T Imag Process 19:1596–1609

    Article  MathSciNet  Google Scholar 

  • Grana C, Montangero M, Borghesani D, Cucchiara R (2011) Optimal decision trees generation from or-decision tables, in: image analysis and processing—ICIAP 2011, volume 6978. Ravenna, Italy, pp 443–452

    Google Scholar 

  • Grana C, Montangero M, Borghesani D (2012) Optimal decision trees for local image processing algorithms, Pattern Recognition Letters, doi: http://dx.doi.org/10.1016/j.patrec.2012.08.015

  • Hall MA (1998) Correlation-based feature subset selection for machine learning. PhD Thesis, Hamilton

  • Jain S, Steffen Lange S, Zilles S (2007) Some natural conditions on incremental learning. Inf Comput 205:1671–1684

    Article  MATH  Google Scholar 

  • Joel ED, Brian AM (2010) The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution. Sci Comput Program 75:943–979

    Article  MATH  Google Scholar 

  • Lee CH, Lee YC (2012) Nonlinear systems design by a novel fuzzy neural system via hybridization of electromagnetism-like mechanism and particle swarm optimisation algorithms. Inf Sci 186:59–72

    Article  Google Scholar 

  • Lughofer E (2012) Hybrid active learning for reducing the annotation effort of operators in classification systems. Pattern Recogn 45:884–896

    Article  Google Scholar 

  • Mahmood AM, Kuppa MR (2010) Early detection of clinical parameters in heart disease by improved decision tree algorithm, second Vaagdevi International Conference on information technology for real world problems. IEEE Comput Soc doi 10.1109/VCON.2010.12

  • Mahmood AM, Kuppa MR (2012) A novel pruning approach using expert knowledge for data-specific pruning. Eng Comput 28:21–30. doi:10.1007/s00366-011-0214-1

    Article  Google Scholar 

  • Mahmood AM, Imran M, Satuluri N, Kuppa MR and Rajesh V (2011) An improved CART decision tree for datasets with irrelevant feature. In: Panigrahi BK et al (Eds): SEMCCO 2011, Part I, LNCS 7076, Springer-Verlag Heidelberg, pp 539–549

  • Nasir MD, Das S, Maity D, Sengupta S, Halder U, Suganthan PN (2012) A dynamic neighborhood learning based particle swarm optimizer for global numerical optimization. Inf Sci 209:16–36

    Article  MathSciNet  Google Scholar 

  • Niu B, Cheng J, Bai X, Lu H (Article in Press). Asymmetric propagation based batch mode active learning for image retrieval, Signal Processing

  • Quellec G, Lamard M, Abràmoff MD, Decencière E, Lay B, Erginay A, Cochener B, Cazuguel G (2012) A multiple-instance learning framework for diabetic retinopathy screening. Med Imag Anal 16:1228–1240

    Article  Google Scholar 

  • Quinlan JR (1993) C4.5: programs for machine learning. Morgan Kaufmann, San Francisco

    Google Scholar 

  • Schumacher H, Sevcik KC (1976) The synthetic approach to decision table conversion. Commun ACM 19:343–351

    Article  MATH  Google Scholar 

  • Shukla SK, Tiwari MK (2009) Soft decision trees: a genetically optimized cluster oriented approach. Expert Syst Appl 36:551–563

    Article  Google Scholar 

  • Witten IH, Frank E (2005) Data mining: practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, San Francisco

    Google Scholar 

  • Yu X, Huang D, Jiang Y, Jin Y (2012) Iterative learning belief rule-base inference methodology using evidential reasoning for delayed coking unit. Control Eng Pract 20:1005–1015

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bhanu Prakash Battula.

Appendix

Appendix

See Tables 3, 4, 5, and 6.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Battula, B.P., Satya Prasad, R. A novel network framework using similar-to-different learning strategy. AI & Soc 30, 129–138 (2015). https://doi.org/10.1007/s00146-013-0499-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00146-013-0499-2

Keywords

Navigation