Bridging the Communication Gap: Sign Language Recognition Technology for the Speech and Hearing Impaired
Safa Shubbar, Shivani Ganta, Thejeswar Reddy Timmapuram, Lakshmi Poojitha Vangapalli, Komal Jilkara, Hanan Muhajab, Areej Muhajab, Kambiz Ghazinour, Stacy Miner · Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering · 2024
This paper presents a comprehensive framework for understanding the properties of nodes in a weighted network related to an algorithmic process based on counterfactuals.The framework is applied to the problem of community detection to demonstrate its general applicability.It identifies counterfactual explanations, revealing which network connections, when modified by changing their weights, would cause a node to lose its community affiliation, answering questions like "Why does node v belong to community C?".The core contribution lies in providing an interpretable and actionable framework for understanding and manipulating network structures. Index Terms-networks, counterfactual explanations, community detection• Assume for the network G = (V, E, w) it holds that v ∈ P. If for G ′ = (V, E, w ′ ), where only w e is changed