Publications

Export 128 results:
Sort by: [ Author (Desc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
T
Trasarti, R, Rinzivillo S, Pinelli F, Nanni M, Monreale A, Renso C, Pedreschi D, Giannotti F.  2010.  Exploring Real Mobility Data with M-Atlas. ECML/PKDD (3). :624-627.
Trasarti, R, Giannotti F, Nanni M, Pedreschi D, Renso C.  2011.  A Query Language for Mobility Data Mining. IJDWM. 7:24-45.
R
Rinzivillo, S, Mainardi S, Pezzoni F, Coscia M, Giannotti F, Pedreschi D.  2012.  Discovering the Geographical Borders of Human Mobility. KI - Künstliche Intelligenz.
Rinzivillo, S, Pedreschi D, Nanni M, Giannotti F, Andrienko N, Andrienko G.  2008.  Visually driven analysis of movement data by progressive clustering. Information Visualization. 7:225-239.
R.Liu, Wang H, Monreale A, Pedreschi D, Giannotti F, Guo W.  2012.  AUDIO: An Integrity Auditing Framework of Outlier-Mining-as-a-Service Systems.. Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2012 .
P
Pensa, RG, Monreale A, Pinelli F, Pedreschi D.  2008.  Pattern-Preserving k-Anonymization of Sequences and its Application to Mobility Data Mining. PiLBA.
Pensa, RG, Monreale A, Pinelli F, Pedreschi D.  2009.  Anonymous Sequences from Trajectory Data. 17th Italian Symposium on Advanced Database Systems.
Pedreschi, D, Ruggieri S, Smaus J-G.  2001.  Classes of Terminating Logic Programs. CoRR. cs.LO/0106
Pedreschi, D, Ruggieri S.  1995.  A Case Study in Logic Program Verification: the Vanilla Metainterpreter. GULP-PRODE. :643-654.
Pedreschi, D, Ruggieri S.  1999.  On Logic Programs That Do Not Fail. Electr. Notes Theor. Comput. Sci.. 30
Pedreschi, D, Ruggieri S.  2003.  On logic programs that always succeed. Sci. Comput. Program.. 48:163-196.
Pedreschi, D, Subrahmanian VS.  1997.  Non-determinism in Deductive Databases - Preface. Ann. Math. Artif. Intell.. 19:1-2.
Pedreschi, D, Ruggieri S, Smaus J-G.  2002.  Classes of terminating logic programs. TPLP. 2:369-418.
Pedreschi, D, Bonchi F, Turini F, Verykios VS, Atzori M, Malin B, Moelans B, Saygin Y.  2008.  Privacy Protection: Regulations and Technologies, Opportunities and Threats. Mobility, Data Mining and Privacy. :101-119.
Pedreschi, D, Ruggieri S.  1999.  Bounded Nondeterminism of Logic Programs. ICLP. :350-364.
Pedreschi, D.  1994.  A Proof Method for Runtime Properties of Prolog Programs. ICLP. :584-598.
Pedreschi, D, Ruggieri S, Turini F.  2008.  Discrimination-aware data mining. KDD. :560-568.
Pedreschi, D, Ruggieri S.  2004.  Bounded Nondeterminism of Logic Programs. Ann. Math. Artif. Intell.. 42:313-343.
Pedreschi, D, Ruggieri S.  1998.  Weakest Preconditions for Pure Prolog Programs. Inf. Process. Lett.. 67:145-150.
Pedreschi, D, Ruggieri S, Turini F.  2009.  Integrating induction and deduction for finding evidence of discrimination. ICAIL. :157-166.
Pedreschi, D, Zaniolo C.  1996.  Logic in Databases, International Workshop LID'96, San Miniato, Italy, July 1-2, 1996, Proceedings. Lecture Notes in Computer Science. 1154
Pedreschi, D, Ruggieri S, Smaus J-G.  2004.  Characterisations of Termination in Logic Programming. Program Development in Computational Logic. :376-431.
Pedreschi, D, Ruggieri S.  1999.  Verification of Logic Programs. J. Log. Program.. 39:125-176.
Pedreschi, D, Ruggieri S, Turini F.  2009.  Measuring Discrimination in Socially-Sensitive Decision Records. SDM. :581-592.
Pedreschi, D, Ruggieri S.  1997.  Verification of Meta-Interpreters. J. Log. Comput.. 7:267-303.