Detecting outliers via logical theories and its data complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3245, Issue , 2004, Pages 101-113

  Angiulli, Fabrizio ^a   Greco, Gianluigi ^b   Palopoli, Luigi ^a  

^a ICAR CNR   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; COMPLEX NETWORKS; DATA HANDLING; INTRUSION DETECTION; STATISTICS;

DATA COMPLEXITY; DATA POPULATION; DOMAIN DENSITY; FRAUD DETECTION; KNOWLEDGE DISCOVERY SYSTEMS; LOGICAL THEORIES; NETWORK ROBUSTNESS; OUTLIER DETECTION;

POPULATION STATISTICS;

EID: 33746831946     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30214-8_8     Document Type: Article

References (17)

1. C. C. Aggarwal and P.S. Yu. Outlier detection for high dimensional data. In Proc. ACM Int. Conference on Managment of Data, 37-46, 2001.
2. F. Angiulli, R. Ben-Eliyahu-Zohary, and L. Palopoli. Outlier detection using default logic. In Proc. Int. Joint Conf. on Artificial Intelligence, 833-838, 2003.
3. F. Angiulli, R. Ben-Eliyahu-Zohary, and L. Palopoli., 2004, Outlier detection using disjunctive logic programming, Frontiers in Artificial Intelligence and Applications, 110, 416-419
4. F. Angiulli, G. Ianni, and L. Palopoli. On the complexity of inducing categorical and quantitative association rules. Theoretical Computer Science, (1-2)314, 217-249, 2004
5. F. Angiulli and C. Pizzuti. Outlier detection in high dimensional spaces. In Proc. of the European Conf. on Principles and Practice of Know. Discovey in Databases, 15-26, 2002.
6. A. Arning, R. Aggarwal, and P. Raghavan. A linear method for deviation detection in large databases. In Proc. Int. Conf. on Know. Discovery and Data Mining, 164-169, 1996.
7. S.D. Bay and M. Schwabacher. Mining Distance-Based Outliers in Near Linear Time with Randomization and a Simple Pruning Rule. In Proc. Int. Conf. on Knowledge Discovery and Data Mining, 2003.
8. M.M. Breunig, H. Kriegel, R.T. Ng, and J. Sander. LOF: Identifying density-based local outliers. In Proc. ACM Int. Conf. on Managment of Data, 93-104, 2000.
9. P. Brucker. On the complexity of some clustering problems. Optimization and Operations Research, 45-54, Springer-Verlag, 1978.
10. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Fifth Int'l Conf.Symp. on Logic Programming, 1070-1080, 1988.
11. D. Gunopulos, H. Mannila, and S. Saluja. Discovering all most specific sentences by randomized algorithms. In Proc. Int. Conf. on Database Theory, 215-229, 1997.
12. E. Knorr and R. Ng. Algorithms for mining distance-based outliers in large datasets. In Proc. Int. Conf. on Very Large Databases, 392-403, 1998.
13. A. Lazarevic and L. Ertoz and V. Kumar and A. Ozgur and J. Srivastava. A Comparative Study of Anomaly Detection Schemes in Network Intrusion Detection. In Proc. SIAM Int. Conf. on Data Mining, 2003.
14. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. The dlv system for knowledge representation and reasoning. ACM Transactions on Computational Logic. To Appear.
15. S. Morishita. On classification and regression. In Proc. of the 1st Int. Conf. on Discovery Science, 40-57, 1998.
16. C.H. Papadimitriou. Computatational Complexity. Addison-Wesley, Reading, Mass., 1994.
17. S. Ramaswamy, R. Rastogi, and K. Shim. Efficient algorithms for mining outliers from large data sets. In Proc. ACM Int. Conf. on Managment of Data, 427-438, 2000.