Travelled to:
1 × China
1 × Czech Republic
1 × France
1 × South Korea
1 × Spain
1 × Sweden
2 × Italy
2 × United Kingdom
8 × USA
Collaborated with:
F.Giannotti S.Ruggieri F.Turini P.Mancarella F.Bonchi M.Nanni F.Pinelli ∅ A.Brogi J.Smaus M.Coscia G.Rossetti M.Atzori C.R.Alfonsi N.Scarabottolo M.Simi G.Mainetto G.Manco M.Rondinelli M.Tagliatti R.Barbuti S.Hajian A.Monreale J.Domingo-Ferrer D.Wang C.Song A.Barabási A.Chiarelli V.Mazzotta C.Renso
Talks about:
program (8) logic (8) discoveri (5) discrimin (3) pattern (3) databas (3) mine (3) implement (2) properti (2) algebra (2)
Person: Dino Pedreschi
DBLP: Pedreschi:Dino
Contributed to:
Wrote 21 papers:
- SAC-2014-HajianMPDG
- Fair pattern discovery (SH, AM, DP, JDF, FG), pp. 113–120.
- KDD-2012-CosciaRGP #community #named
- DEMON: a local-first discovery method for overlapping communities (MC, GR, FG, DP), pp. 615–623.
- SAC-2012-PedreschiRT #case study #metric
- A study of top-k measures for discrimination discovery (DP, SR, FT), pp. 126–131.
- KDD-2011-WangPSGB #predict #social
- Human mobility, social ties, and link prediction (DW, DP, CS, FG, ALB), pp. 1100–1108.
- SIGMOD-2010-RuggieriPT #database #named
- DCUBE: discrimination discovery in databases (SR, DP, FT), pp. 1127–1130.
- KDD-2008-PedreschiRT #data mining #mining
- Discrimination-aware data mining (DP, SR, FT), pp. 560–568.
- KDD-2007-GiannottiNPP #mining
- Trajectory pattern mining (FG, MN, FP, DP), pp. 330–339.
- SAC-2006-AtzoriBGP #towards
- Towards low-perturbation anonymity preserving pattern discovery (MA, FB, FG, DP), pp. 588–592.
- SAC-2006-GiannottiNPP #mining #sequence
- Mining sequences with temporal annotations (FG, MN, DP, FP), pp. 593–597.
- ITiCSE-2004-AlfonsiSPS #named #problem
- IT4PS: information technology for problem solving (CRA, NS, DP, MS), p. 241.
- PDCL-2004-PedreschiRS #logic programming #termination
- Characterisations of Termination in Logic Programming (DP, SR, JGS), pp. 376–431.
- CL-2000-BonchiGP #database #logic #on the #verification
- On Verification in Logic Database Languages (FB, FG, DP), pp. 957–971.
- ICLP-1999-PedreschiR #bound #logic programming #nondeterminism #source code
- Bounded Nondeterminism of Logic Programs (DP, SR), pp. 350–364.
- KDD-1999-BonchiGMP #classification #detection
- A Classification-Based Methodology for Planning Audit Strategies in Fraud Detection (FB, FG, GM, DP), pp. 175–184.
- CSL-1998-GiannottiMNP #database #effectiveness #logic #nondeterminism #on the #semantics
- On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases (FG, GM, MN, DP), pp. 58–72.
- ICLP-1994-Pedreschi #prolog #proving #runtime #source code
- A Proof Method for Runtime Properties of Prolog Programs (DP), pp. 584–598.
- PLILP-1994-BrogiCMMPRT #composition #implementation
- Implementations of Program Composition Operations (AB, AC, PM, VM, DP, CR, FT), pp. 292–307.
- NACLP-1990-MancarellaPRT #algebra #logic programming #source code
- Algebraic Properties of a Class of Logic Programs (PM, DP, MR, MT), pp. 23–39.
- PLILP-1990-BrogiMPT #framework #functional #logic programming
- Logic Programming within a Functional Framework (AB, PM, DP, FT), pp. 372–386.
- JICSCP-1988-MancarellaP88 #algebra #logic programming #source code
- An Algebra of Logic Programs (PM, DP), pp. 1006–1023.
- CFLP-1987-BarbutiMPT #implementation #logic programming #source code
- Intensional Negation of Logic Programs: Examples and Implementation Techniques (RB, PM, DP, FT), pp. 96–110.