CFP last date
20 December 2024
Reseach Article

A New Dissimilarity Measure between Feature-Vectors

by Liviu Octavian Mafteiu-scai
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 64 - Number 17
Year of Publication: 2013
Authors: Liviu Octavian Mafteiu-scai
10.5120/10730-5734

Liviu Octavian Mafteiu-scai . A New Dissimilarity Measure between Feature-Vectors. International Journal of Computer Applications. 64, 17 ( February 2013), 39-44. DOI=10.5120/10730-5734

@article{ 10.5120/10730-5734,
author = { Liviu Octavian Mafteiu-scai },
title = { A New Dissimilarity Measure between Feature-Vectors },
journal = { International Journal of Computer Applications },
issue_date = { February 2013 },
volume = { 64 },
number = { 17 },
month = { February },
year = { 2013 },
issn = { 0975-8887 },
pages = { 39-44 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume64/number17/10730-5734/ },
doi = { 10.5120/10730-5734 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:16:44.721524+05:30
%A Liviu Octavian Mafteiu-scai
%T A New Dissimilarity Measure between Feature-Vectors
%J International Journal of Computer Applications
%@ 0975-8887
%V 64
%N 17
%P 39-44
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Distance measures is very important in some clustering and machine learning techniques. At present there are many such measures for determining the dissimilarity between the feature-vectors, but it is very important to make a choice that depends on the problem to be solved. This paper proposes a simple but robust distance measure called Reference Distance Weighted, for calculating distance between feature-vectors with real values. The basic attribute that distinguishes it from other measures is that the distance is measured from one of the feature-vector, considered as a reference system, to other feature-vectors. In fact this reference vector belongs to a class of a classification system. A second distinctive attribute is that its value does not depend on the orders of magnitude of the different characteristics of vectors. In addition, through a parameter called factor of relevance, each feature receives a weight in terms of its influence, because different features have different influence on dissimilarity estimation depending on the final problem to be solved. An extension of the proposed distance allows working with hybrid vectors, ie real and logical values. Future research directions are also provided.

References
  1. R. Hamming, "Error detecting and error correcting codes", The BellSystem Technical Journal, vol. XXVI, pp. 147–160, April 1950.
  2. Kruskal J. B. , Multidimensional scaling by optimizing goodness of fit to a non metric hypothesis. " Psychometrika 29(1):1-2, 1964
  3. A. Bhattacharya, P. Kar, M. Pal, „On Low Distortion Embeddings of Statistical Distance Measures into Low Dimensional Spaces", Springer, LNCS, Vol. 5690, pp 164-172, 2009
  4. K. Chaudhuri, A. McGregor, „Finding Metric Structure in Information-Theoretic Clustering", in Proceedings of COLT 2008, pp. 391–402, 2008
  5. J. Yu, J. Amores, N. Sebe, Q. Tian, „A new study on distance metrics as similarity measurement", IEEE Proc. ICME 2006, E ISBN:1-4244-0367-7, pp. 533 – 536, 2006
  6. J. Yu, J. Amores, N. Sebe, P. Radeva, Q. Tian ,"Distance Learning for Similarity Estimation", IEEE Trans. on pattern analysis and machine intelligence, vol. 30, no. 3, march 2008
  7. A. Bookstein, S. T. Klein, T. Raita, „Fuzzy Hamming Distance: A New Dissimilarity Measure", LNCS Vol. 2089, 2006, pp 86-97, Springer2006
  8. B. G. Park, K. M. Lee, S. U. Lee, „A New Similarity Measure for Random Signatures: Perceptually Modified Hausdorff Distance", J. Blanc-Talon et al. (Eds. ): ACIVS 2006, LNCS 4179, pp. 990–1001, 2006, Springer 2006
  9. M. P. Dubuisson, A. K. Jain, "A modified Hausdorff distance for object matching" Proc. of IEEE International Conference on Pattern Recognition,pp. 566-568, October 1994.
  10. D. G. Sim, O. K. Kwon, R. H. Park, "Object matching algorithms using robust Hausdorff distance measures", IEEE Trans. Image Processing, vol. 8, no. 3, pp. 425-428, March 1999.
  11. L. Wang, C. Yang, J. Feng, „On Learning with Dissimilarity Functions", Proceedings of the 24th International Conference on Machine Learning, Corvallis, OR, 2007
  12. L. O. Mafteiu-Scai, V. Negru, D. Zaharie, O. Aritoni, Average bandwidth reduction in sparse matrices using hybrid heuristics, Studia Universitatis Babes-Bolyai University, Cluj Napoca, Volume LVI Number 3 Sept. 2011, pp 97-102, ISSN:1224-869x, 2011
  13. Shuting Xu, Jun Zhang, "A new data mining approach to predict matrix condition number", Communication in information an systems 2004 International Press Vol. 4, No. 4, pp. 325-340, 2004
  14. Shuting Xu, "Study and Design of an Intelligent Preconditioner Recommendation System" (2005). Doctoral Dissertation Paper 327, University of Kentucky, http://uknowledge. uky. edu/gradschool_diss/327,2005
  15. T. George, „A Recommendation system for preconditioned iterative solvers", Doctoral Dissert. Texas A&M University, http://repository. tamu. edu/bitstream/handle/1969. 1/ETD-TAMU-2009-12-7458/GEORGE-DISSERTATION. pdf?sequence=2, 2009
Index Terms

Computer Science
Information Sciences

Keywords

classification distance dissimilarity features