Abstract
Contextual probability (G) provides an alternative, efficient way of estimating (primary) probability (P) in a principled way. G is defined in terms of P in a combinatorial way, and they have a simple linear relationship. Consequently, if one is known, the other can be calculated. It turns out G can be estimated based on a set of data samples through a simple process called neighbourhood counting. Many results about contextual probability are obtained based on the assumption that the event space is the power set of the sample space. However, the real world is usually not the case. For example, in a multidimensional sample space, the event space is typically the set of hyper tuples which is much smaller than the power set. In this paper, we generalise contextual probability to multidimensional sample space where the attributes may be categorical or numerical. We present results about the normalisation constant, the relationship between G and P and the neighbourhood counting process.
Hui Wang gratefully acknowledges support by EU Horizon 2020 Programme (700381, ASGARD).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The concept of neighbourhood is used in different contexts with possibly different definitions. The use of this concept in this paper is defined as such.
- 2.
This is common in statistics. See, e.g., [3].
- 3.
References
Ash, R.B., Doléans-Dade, C.: Probability and Measure Theory. Academic Press, San Diego (2000)
Chen, S., Ma, B., Zhang, K.: On the similarity and the distance metric. Theoret. Comput. Sci. 410(24–25), 2365–2376 (2009)
Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley, New York (1973)
Feller, W.: An Introduction to Probability Theory and Its Applications. Wiley, New York (1968)
Hajek, A.: Probability, logic and probability logic. In: Goble, L. (ed.) Blackwell Companion to Logic, pp. 362–384. Blackwell, Oxford (2000)
Lin, Z., Lyu, M., King, I.: Matchsim: a novel similarity measure based on maximum neighborhood matching. Knowl. Inf. Syst. 32, 141–166 (2012)
Mani, A.: Comparing dependencies in probability theory and general rough sets: Part-a. arXiv:1804.02322v1
Mani, A.: Probabilities, dependence and rough membership functions. Int. J. Comput. Appl. 39, 17–35 (2017)
TolgaKahraman, H.: A novel and powerful hybrid classifier method: development and testing of heuristic k-nn algorithm with fuzzy distance metric. Data Knowl. Eng. 103, 44–59 (2016)
Wang, H.: Nearest neighbors by neighborhood counting. IEEE Trans. Pattern Anal. Mach. Intell. 28(6), 942–953 (2006)
Wang, H., Düentsch, I., Trindade, L.: Lattice machine classification based on contextual probability. Fundamenta Informaticae 127(1–4), 241–256 (2013). https://doi.org/10.3233/FI-2013-907
Wang, H., Düntsch, I., Gediga, G., Skowron, A.: Hyperrelations in version space. Int. J. Approximate Reasoning 36(3), 223–241 (2004)
Wang, X., Ouyang, J., Chen, G.: Simplifying calculation of graph similarity through matrices. In: Li, D., Li, Z. (eds.) CCTA 2015. IAICT, vol. 479, pp. 417–428. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-48354-2_41
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, H., Wang, B. (2018). Contextual Probability Estimation from Data Samples – A Generalisation. In: Nguyen, H., Ha, QT., Li, T., Przybyła-Kasperek, M. (eds) Rough Sets. IJCRS 2018. Lecture Notes in Computer Science(), vol 11103. Springer, Cham. https://doi.org/10.1007/978-3-319-99368-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-99368-3_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99367-6
Online ISBN: 978-3-319-99368-3
eBook Packages: Computer ScienceComputer Science (R0)