Abstract
Identifying likeness between events is one of the fundamental necessities in machine learning and data mining techniques. Though grouping of events usually happens on their proximity in Euclidean space or the degree of similarity or the extent of linear dependence, certain applications like keyword and document clustering, phylogenetic profiling and feature selection tend to yield better results if events are grouped based on their mutual association. This paper presents a metric, the Bidirectional Association Similarity (BiAS) to quantify the degree of mutual association between a pair of events. We put forward generalized formulation to compute BiAS and establish unidirectional correspondence with the Jaccard and the cosine similarities. The measure can be suitably incorporated with clustering algorithms in grouping mutually associative events with adding precision to the discovered knowledge.
Chapter PDF
Similar content being viewed by others
Keywords
References
Agrawal, R., Imielinski, T., Swamy, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. ACM Int’l Conf. on Management of Data (SIGMOD), Washington, DC, pp. 207–216 (May 1993)
Blake, C., Pratt, W.: Better rules, fewer features: a semantic approach to selecting features from text. In: Proc. IEEE Intl. Conf. on Data Mining (ICDM 2001), pp. 59–66 (2001)
Dai, X., Jia, J., Ghaoui, L.E., Yu, B.: SBA-term: Sparse Bilingual Association for Terms. In: Fifth Intl. Conf. on Semantic Computing (ICSC 2011), pp. 189–192 (2011)
Everitt, B.: Cluster analysis, 3rd edn. Edward Arnold, London (1993)
Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Englewood Cliffs, N.J (1998)
MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proc. 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1965)
Tanimoto, T.T.: IBM Internal Report November 17 (1957)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhattacharyya, R. (2013). BiAS: A Theme Metric to Model Mutual Association. In: Maji, P., Ghosh, A., Murty, M.N., Ghosh, K., Pal, S.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2013. Lecture Notes in Computer Science, vol 8251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45062-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-45062-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45061-7
Online ISBN: 978-3-642-45062-4
eBook Packages: Computer ScienceComputer Science (R0)