Abstract
The development of effective knowledge discovery techniques has become in the recent few years a very active research area due to the important impact it has in several relevant application areas. One interesting task thereof is that of singling out anomalous individuals from a given population, e.g., to detect rare events in time-series analysis settings, or to identify objects whose behavior is deviant w.r.t. a codified standard set of “social” rules. Such exceptional individuals are usually referred to as outliers in the literature.
Recently, outlier detection has also emerged as a relevant KR&R problem in the context of default logic [2]. For instance, detection algorithms can be used by rational agents to single out those observations that are anomalous to some extent w.r.t. their own, trustable knowledge about the world encoded in the form of a suitable logic theory.
In this paper, we formally state the concept of outliers in the context of logic programming. Besides the novel formalization we propose which helps in shedding some lights on the real nature of outliers, a major contribution of the work lies in the exploitation of a minimality criteria in their detection. Moreover, the computational complexity of outlier detection problems arising in this novel setting is thoroughly investigated and accounted for in the paper as well. Finally, we also propose a rewriting algorithm that transforms any outlier problem into an equivalent answer set computation problem, thereby making outlier computation effective and realizable on top of any answer set engine.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, C.C., Yu, P.S.: Outlier detection for high dimensional data. In: Proc. ACM Int. Conf. on Managment of Data, pp. 37–46 (2001)
Angiulli, F., Ben-Eliyahu-Zohary, R., Palopoli, L.: Outlier detection using default logic. In: Proc. of the Int. Joint Conf. on Artificial Intelligence, pp. 833–838 (2003)
Arning, A., Aggarwal, R., Raghavan, P.: A linear method for deviation detection in large databases. In: Proc. Int. Conf. on Knowledge Discovery and Data Mining, pp. 164–169 (1996)
Breunig, M.M., Kriegel, H., Ng, R.T., Sander, J.: LOF: Identifying density-based local outliers. In: Proc. ACM Int. Conf. on Managment of Data, pp. 93–104 (2000)
Chen, Z., Toda, S.: The complexity of selecting maximal solutions. Information and Computation 119(2), 231–239 (1995)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Fifth Int’l Conf.Symp. on Logic Programming, Seattle, pp. 1070–1080 (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Janhunen, T., Niemelä, I., Simons, P., You, J.-H.: Partiality and disjunctions in stable model semantics. In: KR, pp. 411–419 (2000)
Knorr, E., Ng, R.: Algorithms for mining distance-based outliers in large datasets. In: Proc. Int. Conf. on Very Large Databases, pp. 392–403 (1998)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Transactions on Computational Logic (to Appear)
Lin, F., You, J.H.: Abduction in logic programming: a new definition and an abductive procedure based on rewriting. Artificial Intelligence 140(1-2), 175–205 (2002)
Niemelä, I., Simons, P.: Smodels:An implementation of the stable model and well-founded semantics for normal LP. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS (LNAI), vol. 1265, pp. 420–429. Springer, Heidelberg (1997)
Papadimitriou, C.H.: Computatational Complexity. Addison-Wesley, Reading (1994)
Ramaswamy, S., Rastogi, R., Shim, K.: Efficient algorithms for mining outliers from large data sets. In: Proc. ACM Int. Conf. on Managment of Data, pp. 427–438 (2000)
Reiter, R.: A Theory of Diagnosis from First Principles. Artificial Intelligence 32(1), 57–96 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angiulli, F., Greco, G., Palopoli, L. (2004). Discovering Anomalies in Evidential Knowledge by Logic Programming. In: Alferes, J.J., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2004. Lecture Notes in Computer Science(), vol 3229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30227-8_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-30227-8_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23242-1
Online ISBN: 978-3-540-30227-8
eBook Packages: Springer Book Archive