Abstract
Dynamic Data Driven Applications Systems (DDDAS) utilize data augmentation for system performance. To enhance DDDAS systems with domain experts, there is a need for interactive and explainable active feature elicitation in relational domains in which a small subset of data is fully observed while the rest of the data is minimally observed. The goal is to identify the most informative set of entities for whom acquiring the relations would yield a more robust model. Assuming the presence of a human expert who can interactively score the relations, there is a need for an explainable model designed using the Feature Acquisition via Interaction in Relational domains (FAIR) algorithm. FAIR employs a relational tree-based distance metric to identify the most diverse set of relational examples (entities) to obtain more relational feature information for user refinement. The model that is learned iteratively is usable, interpretable, and explainable.
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
References
Bilgic, M., Mihalkova, L., Getoor, L.: Active learning for networked data. In: ICML (2010)
Blasch, E., Ravela, S., Aved, A.: Handbook of Dynamic Data Driven Application Systems. Springer (2018)
Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka, E., Jr.: and T. Mitchell. Toward an architecture for never-ending language learning, In AAAI (2010)
Getoor, L., Taskar, B.: Introduction to Statistical Relational Learning. MIT Press, (2007)
Kanani, P., Melville, P.: Prediction-time active feature-value acquisition for cost-effective customer targeting. Workshop on Cost Sensitive Learning at NIPS (2008)
Kersting, K., De Raedt, L.: Bayesian logic programming: Theory and tool. In: An Introduction to Statistical Relational Learning (2007)
Khot, T., Natarajan, S., Shavlik, J.W.: Relational one-class classification: A non-parametric approach. In: AAAI (2014)
Kullback, S., Leibler, R.A.: On information and sufficiency. The annals of mathematical statistics (1951)
Kuwadekar, A., Neville, J.: Relational active learning for joint collective classification models. In: ICML (2011)
Macskassy, S.A.: Using graph-based metrics with empirical risk minimization to speed up active learning on networked data. In: KDD (2009)
Natarajan, S., Das, S., Ramanan, N., Kunapuli, G., Radivojac, P.: On whom should i perform this lab test next? an active feature elicitation approach. In: IJCAI (2018)
Raedt, L., Kersting, K., Natarajan, S., Poole, D.: Statistical relational artificial intelligence: Logic, probability, and computation. Morgan Claypool (2016)
Shavlik, J.W., Towell, C.G.: Combining explanation-based learning and artificial neural networks. In: Proceedings of the Sixth International Workshop on Machine Learning. Elsevier (1989)
Tadepalli, P.: A formalization of explanation-based macro-operator learning. In: IJCAI (1991)
Thahir, M., Sharma, T., Ganapathiraju, M.K.: An efficient heuristic method for active feature acquisition and its application to protein-protein interaction prediction. In: MC Proc (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ramanan, N., Odom, P., Blasch, E., Kersting, K., Natarajan, S. (2024). Relational Active Feature Elicitation for DDDAS. In: Blasch, E., Darema, F., Aved, A. (eds) Dynamic Data Driven Applications Systems. DDDAS 2022. Lecture Notes in Computer Science, vol 13984. Springer, Cham. https://doi.org/10.1007/978-3-031-52670-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-031-52670-1_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-52669-5
Online ISBN: 978-3-031-52670-1
eBook Packages: Computer ScienceComputer Science (R0)