Instance Based Classification for Decision Making in Network Data

Journal of Intelligent Systems 21 (2):167-193 (2012)
  Copy   BIBTEX

Abstract

. Network data analysis helps in capturing node usage behavior. Existing algorithms use reduced feature set to manage high runtime complexity. Ignoring features may increase classification errors. This paper presents a model, allowing classification of network traffic, while considering all the relevant features. Learning phase partitions training sample on values of the respective features. This creates equivalence classes related to m features. During classification, each feature value of the test instance results in picking one set from equivalence class generated during learning. Algorithm captures new behavior in semi-supervised incremental learning mode. For problems having m features and n training samples the model has incremental learning complexity of and average classification complexity is of the order.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Where Do Features Come From?Geoffrey Hinton - 2014 - Cognitive Science 38 (6):1078-1101.
Statistical Learning Theory: A Tutorial.Sanjeev R. Kulkarni & Gilbert Harman - 2011 - Wiley Interdisciplinary Reviews: Computational Statistics 3 (6):543-556.
A Configural-Cue Network Model of Classification Learning.M. A. Gluck & G. H. Bower - 1988 - Bulletin of the Psychonomic Society 26 (6):500-500.
Classification.Daniel Parrochia - 2016 - Internet Encyclopedia of Philosophy.

Analytics

Added to PP
2017-01-12

Downloads
48 (#324,723)

6 months
22 (#119,049)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references