Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3487664.3487709acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiiwasConference Proceedingsconference-collections
short-paper

CoSim: An Approach to Calculate Complex Object Similarity

Published: 30 December 2021 Publication History

Abstract

Complex objects are often described by several attributes of arbitrary types. To calculate the similarity between complex objects, we propose the CoSim process, which provides a composed similarity function. CoSim applies existing similarity functions for each data type of the object. To calculate the overall similarity, we weight these type-specific similarities. We demonstrate the practical application of our approach by using a simple example of objects. The example involves numerical and categorical attributes. However, our presented idea is applicable to objects with attributes of arbitrary types.

References

[1]
Charu C. Aggarwal. 2015. Data mining: The textbook. Springer, Cham.
[2]
Gilles Bisson. [n. d.]. Why and how to define a similarity measure for object based representation systems. In Towards Very Large Knowledge Bases. 236–246.
[3]
Gilles Bisson. 1992. Learning in FOL with a Similarity Measure. AAAI-92 Proceedings (1992), 82–87.
[4]
Seung-Seok Choi, Sung-Hyuk Cha, and Charles C. Tappert. 2010. A survey of binary similarity and distance measures. Journal of Systemics, Cybernetics and Informatics 8, 1(2010), 43–48.
[5]
Werner Emde and Dietrich Wettschereck. 1996. Relational instance-based learning. ICML 96(1996), 122–130.
[6]
Martin Ester and Jörg Sander. 2000. Knowledge Discovery in Databases: Techniken und Anwendungen. Springer Berlin Heidelberg.
[7]
J. C. Gower. 1971. A General Coefficient of Similarity and Some of Its Properties. Biometrics 27, 4 (1971), 857.
[8]
Jiawei Han, Micheline Kamber, and Jian Pei. 2011. 2 - Getting to Know Your Data. In Data Mining: Concepts and Techniques, Jiawei Han, Micheline Kamber, and Jian Pei (Eds.). Morgan Kaufmann Publishers Inc., San Francisco, USA, 39–82.
[9]
Jiawei Han, Micheline Kamber, and Jian Pei (Eds.). 2011. Data Mining: Concepts and Techniques(3 ed.). Morgan Kaufmann Publishers Inc., San Francisco, USA.
[10]
Tamás Horváth, Stefan Wrobel, and Uta Bohnebeck. 2001. Relational Instance-Based Learning with Lists and Terms. Machine Learning 43(2001), 53–80. https://doi.org/10.1023/A:1007668716498
[11]
Paul Jaccard. 1908. Nouvelles recherches sur la distribution florale. Bull. Soc. Vaud. Sci. Nat. 44 (1908), 223–270.
[12]
Eshref Januzaj. 2013. Extending Diseasome by Integrating the Knowledge from Distributed Databases. 24th International Workshop on Database and Expert Systems Applications (DEXA) (2013), 105–109.
[13]
Leonard Kaufman and Peter J. Rousseeuw. 2005. Finding groups in data: An introduction to cluster analysis. Wiley, Hoboken, NJ, USA.
[14]
Igor Kononenko. 1994. Estimating attributes: Analysis and extensions of RELIEF. Proceedings of the European Conference on Machine Learning (ECML) (1994), 171–182.
[15]
Pang-Ning Tan, Michael Steinbach, and Vipin Kumar. 2005. Introduction to data mining. Pearson Addison-Wesley, Boston.
[16]
M. J. Zaki and W. Meira. 2014. Data Mining and Analysis: Fundamental Concepts and Algorithms. Cambridge University Press.

Index Terms

  1. CoSim: An Approach to Calculate Complex Object Similarity
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Please enable JavaScript to view thecomments powered by Disqus.

        Information & Contributors

        Information

        Published In

        cover image ACM Other conferences
        iiWAS2021: The 23rd International Conference on Information Integration and Web Intelligence
        November 2021
        658 pages
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 30 December 2021

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. Complex object similarity
        2. KDD
        3. RELIEF
        4. attribute type weighting

        Qualifiers

        • Short-paper
        • Research
        • Refereed limited

        Conference

        iiWAS2021

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • 0
          Total Citations
        • 29
          Total Downloads
        • Downloads (Last 12 months)6
        • Downloads (Last 6 weeks)1
        Reflects downloads up to 20 Nov 2024

        Other Metrics

        Citations

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format.

        HTML Format

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media