Abstract
Data in modern networks should be analysed in real time. This is necessary to maintain security and enable management. The real problem is the size of analysed data and its classification. One of several solutions to these problems may be reduction the reference network data set. Most algorithms for the condensation of the reference set involve a lot of computation when processing a very large set which contains several dozens of objects. That was the basis for our attempt to develop a completely new classifier which would maintain the quality of classification on the levels obtained with the primary reference set as well as allow to accelerate computations considerably. The proposed solution consists in covering the primary reference set with disjoint hyperspheres; however, these hyperspheres may contain objects from one class only. Classification is completed when it has been determined that the classified point belongs to one of the mentioned spheres. If an object does not belong to any hypersphere, it is counted among the objects of the same class, to which the objects from the nearest hypersphere belong (the distance to the centre of the sphere minus the radius). As was shown in our tests, this algorithm was very effective with very large data sets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. John Wiley & Sons, Inc. (2001)
Fix, E., Hodges Jr., J.L.: Discriminatory Analysis - Nonparametric Discrimination: Consistency Properties, Project 21-49-004, Report No. 4, US AF School of Aviation Medicine, Randolph Field, Tex., pp. 261–279 (1951)
Sánchez, J.S., Pla, F., Ferri, F.J.: On the use of neighbourhood-based non-parametric classifiers. Pattern Recognition Letters 18(11-13), 1179–1186 (1997)
Sierra, B., Larrañaga, P., Inza, I.: K-Diplomatic Nearest Neighbour: giving equal chance to all existing classes. Journal of Artificial Intelligence Research (2000)
Hort, R.D., Fukunaga, K.: A new nearest neighbour distance measure. In: 5th IEEE International Conference on Pattern Recognition, Miami Beach, Florida, USA, pp. 81–86 (1980)
Short, R.D., Fukunaga, K.: The optimal distance measure for nearest neighbour classification. IEEE Transactions on Information Theory IT-27, 622–627 (1981)
Kuncheva, L.I.: Reducing the Computational Demand of the Nearest Neighbor Classifier, School of Informatics. In: Symposium on Computing 2001, Aberystwyth, UK, pp. 61–64 (2001)
Jóźwik, A., Chmielewski, L., Cudny, W., Skłodowski, M.: A 1-NN preclassifier for fuzzy k-NN rule. In: 13th International Conference on Pattern Recognition, Vienna, Austria, vol. IV(D), pp. 234–238 (1996)
Keller, J.M., Gray, M.R., Givens Jr., J.A.: A Fuzzy k-Nearest Neighbor Algorithm. IEEE Transactions on Systems, Man, and Cybernetics SMC-15(4), 580–585 (1985)
Jóźwik, A.: A learning scheme for a fuzzy k-NN rule. Pattern Recognition Letters 1(5-6), 287–289 (1983)
Lee, W., Stolfo, S.J., Mok, K.W.: Mining in a data-flow environment: Experience in network intrusion detection. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 1999) (August 1999)
Stolfo, S.J., Fan, W., Lee, W., Prodromidis, A., Chan, P.K.: Cost-based Modeling for Fraud and Intrusion Detection: Results from the JAM Project. Computer Science Department Columbia University (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Sierszeń, A. (2015). Reduction of Reference Set for Network Data Analyzing Using the Bubble Algorithm. In: Choraś, R. (eds) Image Processing & Communications Challenges 6. Advances in Intelligent Systems and Computing, vol 313. Springer, Cham. https://doi.org/10.1007/978-3-319-10662-5_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-10662-5_39
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10661-8
Online ISBN: 978-3-319-10662-5
eBook Packages: EngineeringEngineering (R0)