The ultrametric properties of binary datasets

• Autorzy: Wilczek P.
• Języki publikacji: EN

Abstrakty

EN

Many multivariate algorithms commonly applied for binary datasets depend on a proper metric (i.e., dissimilarity function) imposed on binary vectors. In the following work the relationships between different metrics defined on the randomly generated binary datasets and the cophenetic correlation coefficient (CCC) will be presented.

Słowa kluczowe

EN

binary data sets; dissimilarity function; clustering; cophenetic correlation coefficient

PL

binarny zestaw danych; funkcja odmienności; klasteryzacja; współczynnik korelacji

• Wydawca: Wydawnictwo Politechniki Śląskiej
• Czasopismo: Silesian Journal of Pure and Applied Mathematics
• Rocznik: 2016
• Tom: Vol. 6, iss. 1
• Strony: 69--83
• Opis fizyczny: Bibliogr. 30 poz.

Twórcy

autor

Wilczek P.

• Computer Laboratory, Poznań, Poland

Bibliografia

• 1. Cassu C., Ferrer J.G., Bonet J.: Classification of several business sectors according to uncertain characteristics. In: Handbook of management under uncertainty. Gil-Aluja J. (ed.), Kluwer Academic Publ., Dordrecht 2001.
• 2. Cha S-H.: Comprehensive survey on distance/similarity measures between probability density functions. Int. J. Math. Models Methods Appl. Sci. 1 (2007), 300–307.
• 3. Choi S-S., Cha S-H, Tappert C.C.: A survey of binary similarity and distance measures. Journal of Systemics, Cybernetics and Informatics 8 (2010), 43–48.
• 4. Csardi G., Nepusz T.: The igraph software package for complex network research. InterJournal Complex Syst. 1695 (2006), http://igraph.org
• 5. Dray S., Dufour A.B.: The ade4 package: implementing the duality diagram for ecologists. J. Stat. Soft. 22 (2007), 1–20.
• 6. Duda R.O., Hart P.E., Stork D.G.: Pattern Classification. Wiley Interscience, New York 2000.
• 7. Erdos P., Renyi A.: On random graphs. Publ. Mat. 6 (1959), 290-297.
• 8. Ganter B., Wille R.: Formal Concept Analysis: Mathematical Foundations. Springer-Verlag, Berlin 1998.
• 9. Gower J.C.: A general coefficient of similarity and some of its properties. Biometrics 27 (1971), 857-871.
• 10. Gower J.C., Legendre P.: Metric and Euclidean properties of dissimilarity coefficients. J. Classification 3 (1986), 5-48.
• 11. Grossman D.A., Frieder O.: Information Retrieval: Algorithms and Heuristics. Springer, Dordrecht 2004.
• 12. Hastie T., Tibshirani R., Friedman J.: Elements of Statistical Learning. Springer-Verlag, New York 2009.
• 13. Ibrahim H.M., Marghny M.H., Abdelaziz N.M.A.: Fast vertical mining using Boolean algebra. Int. J. Adv. Comput. Sci. Appl. 6 (2015), 89–96.
• 14. Ihaka R., Gentleman R.: A language for data analysis and graphics. J. Comput. Graph. Statist. 5 (1996), 299–314.
• 15. Jain A.K., Dubes R.C.: Algorithms for Clustering Data. Prentice Hall, New Jersey 1988.
• 16. Jayalakshmi G., Nageswara Rao K.: Mining association rules for large transactions using new support and confidence measures. J. Theor. Appl. Inform. Technol. 7 (2009), 94–100.
• 17. Lapointe F-J., Legendre P.: Statistical significance of the matrix correlation coefficient for comparing independent phylogenetic trees. Systematic Biology 41 (1992), 378–384.
• 18. Li G., Zaki M.J.: Sampling frequent and minimal Boolean patterns: theory and application in classification. Data Min. Knowl. Discov. 30 (2016), 181–225.
• 19. Li J., Li H., Soh D., Wong L.: A correspondence between maximal complete bipartite subgraphs and closed patterns. Lecture Notes in Comput. Sci. 3721 (2005), 146–156.
• 20. Pathi S., Kothalanka A., Addala V.: Binary matrix approach for mining frequent sequential pattern in large databases. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 4 (2014), 311–317.
• 21. Podani J., Dickinson T.A.: Comparison of dendrograms: a multivariate approach. Can. J. Botany 62 (1984), 2765–2778.
• 22. Sesli M., Yegenoglu E. D.: Comparison of similarity coefficients used for cluster analysis based on RAPD markers in wild olives. Genet. Mol. Res. 9 (2010), 2248–2253.
• 23. Shirkhorshidi A.S., Aghabozorgi S., Wah T.Y.: A comparison study on similarity and dissimilarity measures in clustering continuous data. PloS ONE 10(12): e0144059 (2015), 1–20.
• 24. Simovici D.A., Djeraba C.: Mathematical Tools for Data Mining. SpringerVerlag, London 2008.
• 25. Sneath P.H.A., Sokal R.R.: Numerical Taxonomy. The Principles and Practice of Numerical Classification. W.H. Freeman and Co., San Francisco 1973.
• 26. Sokal R.R., Rohlf F.J.: The comparison of dendrograms by objective methods. Taxon 9 (1962), 33–40.
• 27. Spyropoulou E., De Bie T., Boley M.: Interesting pattern mining in multi – relational data. Data Min. Knowl. Discov. 28 (2014), 808–849.
• 28. Wasserman S., Faust K.: Social Network Analysis: Methods and Applications. Cambridge Univ. Press, Cambridge 1994.
• 29. Wilczek P.: Model-theoretic investigations into consequence operation (Cn) in quantum logics: an algebraic approach. Internat. J. Theoret. Phys. 45 (2006), 679-689.
• 30. Wilczek P.: Constructible models of orthomodular quantum logics. Electron. J. Theor. Phys. 5 (2008), 9–32.