Siegfried Nijssen

Tias Guns, Siegfried Nijssen, Luc De Raedt: k-Pattern Set Mining under Constraints. IEEE Trans. Knowl. Data Eng. 25(2): 402-418 (2013)

Joris Renkens, Guy Van den Broeck, Siegfried Nijssen: k-Optimal: a novel approximate inference algorithm for ProbLog. Machine Learning 89(3): 215-231 (2012)

Thanh Le Van, Ana Carolina Fierroy, Tias Guns, Matthijs van Leeuwen, Siegfried Nijssen, Luc De Raedt, Kathleen Marchal: Mining Local Staircase Patterns in Noisy Data. ICDM Workshops 2012: 139-146

Michael Mampaey, Siegfried Nijssen, Ad Feelders, Arno J. Knobbe: Efficient Algorithms for Finding Richer Subgroup Descriptions in Numeric and Nominal Data. ICDM 2012: 499-508

Joris Renkens, Guy Van den Broeck, Siegfried Nijssen: k-Optimal: A Novel Approximate Inference Algorithm for ProbLog. ILP 2012: 33-38

Ugo Vespier, Arno J. Knobbe, Siegfried Nijssen, Joaquin Vanschoren: MDL-Based Analysis of Time Series at Multiple Time-Scales. ECML/PKDD (2) 2012: 371-386

Anton Dries, Siegfried Nijssen: Mining Patterns in Networks using Homomorphism. SDM 2012: 260-271

Hendrik Blockeel, Kristian Kersting, Siegfried Nijssen, Filip Zelezný: A Revised Publication Model for ECML PKDD. CoRR abs/1207.6324 (2012)

Tias Guns, Siegfried Nijssen, Luc De Raedt: Itemset mining: A constraint programming perspective. Artif. Intell. 175(12-13): 1951-1983 (2011)

Tias Guns, Siegfried Nijssen, Albrecht Zimmermann, Luc De Raedt: Declarative Heuristic Search for Pattern Set Mining. ICDM Workshops 2011: 1104-1111

Siegfried Nijssen, Aída Jiménez, Tias Guns: Constraint-Based Pattern Mining in Multi-relational Databases. ICDM Workshops 2011: 1120-1127

Luc De Raedt, Siegfried Nijssen: Towards Programming Languages for Machine Learning and Data Mining (Extended Abstract). ISMIS 2011: 25-32

Tias Guns, Siegfried Nijssen, Luc De Raedt: Evaluating Pattern Set Mining Strategies in a Constraint Programming Framework. PAKDD (2) 2011: 382-394

Anton Dries, Siegfried Nijssen: Mining Patterns in Networks using Homomorphism. CoRR abs/1110.3225 (2011)

Björn Bringmann, Siegfried Nijssen, Albrecht Zimmermann: Pattern-Based Classification: A Unifying Perspective. CoRR abs/1111.6191 (2011)

Luc De Raedt, Siegfried Nijssen, Barry O'Sullivan, Pascal Van Hentenryck: Constraint Programming meets Machine Learning and Data Mining (Dagstuhl Seminar 11201). Dagstuhl Reports 1(5): 61-83 (2011)

Siegfried Nijssen, Élisa Fromont: Optimal constraint-based decision tree induction from itemset lattices. Data Min. Knowl. Discov. 21(1): 9-51 (2010)

Anton Dries, Luc De Raedt, Siegfried Nijssen: Mining Predictive k-CNF Expressions. IEEE Trans. Knowl. Data Eng. 22(5): 743-748 (2010)

Luc De Raedt, Tias Guns, Siegfried Nijssen: Constraint Programming for Data Mining and Machine Learning. AAAI 2010

Tias Guns, Hong Sun, Kathleen Marchal, Siegfried Nijssen: Cis-regulatory module detection using constraint programming. BIBM 2010: 363-368

Siegfried Nijssen, Tias Guns: Integrating Constraint Programming and Itemset Mining. ECML/PKDD (2) 2010: 467-482

Siegfried Nijssen: Constraint-Based Mining. Encyclopedia of Machine Learning 2010: 221-225

Siegfried Nijssen: Tree Mining. Encyclopedia of Machine Learning 2010: 991-999

Jan Ramon, Siegfried Nijssen: Polynomial-Delay Enumeration of Monotonic Graph Classes. Journal of Machine Learning Research 10: 907-929 (2009)

Anton Dries, Siegfried Nijssen, Luc De Raedt: A query language for analyzing networks. CIKM 2009: 485-494

Siegfried Nijssen, Tias Guns, Luc De Raedt: Correlated itemset mining in ROC space: a constraint programming approach. KDD 2009: 647-656

Siegfried Nijssen, Luc De Raedt: Grammar Mining. SDM 2009: 1026-1037

Siegfried Nijssen: Bayes optimal classification for decision trees. ICML 2008: 696-703

Luc De Raedt, Tias Guns, Siegfried Nijssen: Constraint programming for itemset mining. KDD 2008: 204-212

Björn Bringmann, Siegfried Nijssen: What Is Frequent in a Single Graph?. PAKDD 2008: 858-863

Siegfried Nijssen, Élisa Fromont: Mining optimal decision trees from itemset lattices. KDD 2007: 530-539

Jan Ramon, Siegfried Nijssen: General Graph Refinement with Polynomial Delay. MLG 2007

Jeroen Kazius, Siegfried Nijssen, Joost N. Kok, Thomas Bäck, Adriaan P. IJzerman: Substructure Mining Using Elaborate Chemical Representation. Journal of Chemical Information and Modeling 46(2): 597-605 (2006)

Siegfried Nijssen, Luc De Raedt: IQL: A Proposal for an Inductive Query Language. KDID 2006: 189-207

Björn Bringmann, Albrecht Zimmermann, Luc De Raedt, Siegfried Nijssen: Don't Be Afraid of Simpler Patterns. PKDD 2006: 55-66

Siegfried Nijssen, Joost N. Kok: The Gaston Tool for Frequent Subgraph Mining. Electr. Notes Theor. Comput. Sci. 127(1): 77-87 (2005)

Yun Chi, Richard R. Muntz, Siegfried Nijssen, Joost N. Kok: Frequent Subtree Mining - An Overview. Fundam. Inform. 66(1-2): 161-198 (2005)

Bart Goethals, Siegfried Nijssen, Mohammed Javeed Zaki: Open source data mining: workshop report. SIGKDD Explorations 7(2): 143-144 (2005)

Siegfried Nijssen, Joost N. Kok: Multi-class Correlated Pattern Mining. KDID 2005: 165-187

Siegfried Nijssen, Joost N. Kok: Ideal Refinement of Datalog Clauses Using Primary Keys. ECAI 2004: 520-524

Siegfried Nijssen, Joost N. Kok: A quickstart in frequent structure mining can make a difference. KDD 2004: 647-652

Siegfried Nijssen, Joost N. Kok: Frequent graph mining and its application to molecular databases. SMC (5) 2004: 4571-4577

Siegfried Nijssen, Thomas Bäck: An analysis of the behavior of simplified evolutionary algorithms on trap functions. IEEE Trans. Evolutionary Computation 7(1): 11-22 (2003)

Siegfried Nijssen, Joost N. Kok: Efficient Frequent Query Discovery in FARMER. PKDD 2003: 350-362

Siegfried Nijssen, Joost N. Kok: Faster Association Rules for Multiple Relations. IJCAI 2001: 891-896