Skip to main content

k-NN Ensemble DARA Approach to Learning Relational

  • Conference paper
  • First Online:
Proceedings of the International Conference on Data Engineering 2015 (DaEng-2015)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 520))

Abstract

Due to the growing amount of data generated and stored in relational databases, relational learning has attracted the interest of researchers in recent years. Many approaches have been developed in order to learn relational data. One of the approaches used to learn relational data is Dynamic Aggregation of Relational Attributes (DARA). The DARA algorithm is designed to summarize relational data with one-to-many relations. However, DARA suffers a major drawback when the cardinalities of attributes are very high because the size of the vector space representation depends on the number of unique values that exist for all attributes in the dataset. A feature selection process can be introduced to overcome this problem. These selected features can then be further optimized to achieve a good classification result when using k Nearest Neighbour (k-NN) classifier. Several clustering runs can be performed for different values of k to yield an ensemble of clustering results. This paper proposes a two-layered genetic algorithm-based feature selection in order to improve the classification performance of learning relational database using a k-NN ensemble classifier. The proposed method involves the task of omitting less relevant features but retaining the diversity of the classifiers so as to improve the performance of the k-NN ensemble. Based on the results obtained, it shows that the proposed k-NN ensemble is able to improve the performance of traditional k-NN classifiers.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Fayyad, U., Piatetsky-Shapiro, G., Smyth, P.: From data mining to knowledge discovery in data mining. AI Mag. 17(3) (1996)

    Google Scholar 

  2. Hansen, L.K., Salamon, P.: Neural network ensembles. IEEE Trans. Pattern Anal. Mach. Intell. 12, 993–1001 (1990)

    Article  Google Scholar 

  3. Breiman, L.: Bagging predictors. Mach. Learn. 24, 123–140 (1996)

    MATH  Google Scholar 

  4. Freund, Y., Schapire, R.: Experiments with a new boosting algorithm. In: Thirteenth International Conference on Machine Learning (1996)

    Google Scholar 

  5. Quinlan, J.R.: Bagging, boosting and C4.5. In: Fourteenth National Conference on Artificial Intelligence (1996)

    Google Scholar 

  6. Ali, K.M., Pazzani, M.J.: Error reduction through learning multiple descriptions. Mach. Learn. 24, 173–202 (1996)

    Google Scholar 

  7. Saeys, Y., et al.: A review of feature selection techniques in bioinformatics. Bioinformatics 23, 2507–2517 (2007)

    Article  Google Scholar 

  8. Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. JMLR 3, 1157–1182 (2003)

    MATH  Google Scholar 

  9. Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, 1975; MIT Press, Cambridge, MA (1992)

    Google Scholar 

  10. Fraser, A.S.: Simulation of genetic systems by automatic digital computers I: introduction. Aust. J. Biol. Sci. 10, 484–491 (1957)

    Article  Google Scholar 

  11. Getoor, L.: Multi-relational data mining using probabilistic relational models: research summary. In Proceedings of the First Workshop in Multi-relational Data Mining (2001)

    Chapter  Google Scholar 

  12. Ghanem, A.S., Venkatesh, S., West, G.: Learning in imbalanced relational data. In: 19th International Conference on Pattern Recognition, 2008. ICPR 2008, 8–11 Dec, pp. 1–4 (2008)

    Google Scholar 

  13. Macskassy, S., Provost, F.: A simple relational classifier. In: Proceedings of 2nd Workshop on Multi-Relational Data Mining (MRDM) (2003)

    Google Scholar 

  14. Xu, J., Chen, J, Li, B.: Random forest for relational classification with application to terrorist profiling. In: IEEE International Conference on Granular Computing, GRC’09. 17–18 Aug, pp. 630–633 (2009)

    Google Scholar 

  15. Alfred, R.: Optomizing feature construction process for dynamic aggregation of relational attributes. J. Comput. Sci. 5(11), 864 (2009)

    Article  Google Scholar 

  16. Alfred, R.: The study of dynamic aggregation of relational attributes on relational data mining. In: Alhajj, R., Gao, H., Li, X., Li, J., Zaïane, O.R. (eds.) ADMA 2007. LNCS (LNAI), vol. 4632, pp. 214–226. Springer, Heidelberg (2007)

    Google Scholar 

  17. Alfred, R., Kazakov, D.: A clustering approach to generalized pattern identification based on multi-instanced objects with DARA. In: Local Proceedings of ADBIS, Varna, pp. 38–49 (2007)

    Google Scholar 

  18. Alfred, R., Kazakov, D.: Pattern-based transformation approach to relational domain learning using DARA. In: Crone, S.F., Lessmann, S., Stahlbock, R. (eds.) The Proceedings of the 2006 International Conference on Data Mining (DMIN 2006), Las Vegas, Nevada, USA, CSREA Press, June 25–29, pp. 296–302, ISBN. 1-60132-004-3 (2006)

    Google Scholar 

  19. Kheau, C., Alfred, R., Keng, L.: Dimensionality reduction in data summarization approach to learning relational data. In: 5th Asian Conference, ACIIDS Part I. Springer, Berlin (2013)

    Chapter  Google Scholar 

  20. Alfred, R.: Feature transformation: a genetic-based feature construction method for data summarization. Comput. Intell. 26(3), 337–357 (2010)

    Article  MathSciNet  Google Scholar 

  21. Alfred, R., Kazakov, D.: Discretisation numbers for multiple-instances problem in relational database. In: Ioannidis, Y., Novikov, B., Rachev, B. (eds.) ADBIS 2007. LNCS, vol. 4690, pp. 55–65. Springer, Heidelberg (2007)

    Google Scholar 

  22. Bay, S.D.: Nearest neighbour classification from multiple feature subsets. Intell. Data Anal. 3(3), 191–209 (1999)

    Article  Google Scholar 

  23. Xia, P.-Y., Ding, X.-Q., Jiang, B.-N.: A GA-based feature selection and ensemble learning for high-dimensional datasets. In: IEEE International Conference on Machine Learning and Cybernetics, vol. 3, pp. 7–12 (2009)

    Google Scholar 

  24. Canuto, A.M.P., Nascimento, D.S.C.: A genetic-based approach to features selection for ensembles using a hybrid and adaptive fitness function. In: IEEE International Joint Conference on Neural Networks (IJCNN), pp. 1–8 (2012)

    Google Scholar 

  25. Kuncheva, L., Jain, L.: Designing classifier fusion systems by genetic algorithms. IEEE Trans. Evol. Comput. 4(4), 327–336 (2000)

    Article  Google Scholar 

Download references

Acknowledgements

This work has been supported by the Research Grant Scheme project funded by the Ministry of Education (MOE), Malaysia, under Grants No. RAG0007-TK-2012 and FRGS/2/2014/ICT02/UMS/02/1.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rayner Alfred .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Alfred, R., Shin, K.K., Chin, K.O., Lau, H., Hijazi, M.H.A. (2019). k-NN Ensemble DARA Approach to Learning Relational. In: Abawajy, J., Othman, M., Ghazali, R., Deris, M., Mahdin, H., Herawan, T. (eds) Proceedings of the International Conference on Data Engineering 2015 (DaEng-2015) . Lecture Notes in Electrical Engineering, vol 520. Springer, Singapore. https://doi.org/10.1007/978-981-13-1799-6_22

Download citation

Publish with us

Policies and ethics