• Publications
  • Influence
Substructure Discovery Using Minimum Description Length and Background Knowledge
TLDR
The ability to identify interesting and repetitive substructures is an essential component to discovering knowledge in structural data. Expand
  • 541
  • 47
  • PDF
Graph-Based Data Mining
TLDR
Using databases represented as graphs, the Subdue system performs two key data mining techniques: unsupervised pattern discovery and supervised concept learning from examples. Expand
  • 477
  • 32
  • PDF
Substucture Discovery in the SUBDUE System
TLDR
This paper describes the SUBDUE system, which uses the minimum description length principle to discover substructures that compress the database and represent structural concepts in the data. Expand
  • 289
  • 26
  • PDF
Discovering Activities to Recognize and Track in a Smart Environment
TLDR
The machine learning and pervasive sensing technologies found in smart homes offer unprecedented opportunities for providing health monitoring and assistance to individuals experiencing difficulties living independently at home. Expand
  • 433
  • 24
  • PDF
Mining Graph Data
Preface. Acknowledgments. Contributors. 1 INTRODUCTION (Lawrence B. Holder and Diane J. Cook). 1.1 Terminology. 1.2 Graph Databases. 1.3 Book Overview. References. Part I GRAPHS. 2 GRAPHExpand
  • 321
  • 11
  • PDF
Application of Graph-Based Concept Learning to the Predictive Toxicology Domain
TLDR
We present a graph-based concept learning system using graphs to represent the examples of the concept to learn. Expand
  • 44
  • 10
  • PDF
Graph-based hierarchical conceptual clustering
Hierarchical conceptual clustering has proven to be a useful, although under-explored, data mining technique. A graph-based representation of structural information combined with a substructureExpand
  • 90
  • 8
Conditional random fields for activity recognition in smart environments
TLDR
We describe the use of another probabilistic model: Conditional Random Fields (CRFs), which is currently gaining popularity for its remarkable performance for activity recognition. Expand
  • 61
  • 7
  • PDF
A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs
TLDR
We introduce a "Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. Expand
  • 46
  • 7
  • PDF
Subdue: compression-based frequent pattern discovery in graph data
TLDR
We describe a graph-based data mining system which focuses on the discovery of sub-graphs which are not only frequent but also compress the graph dataset, using a heuristic algorithm. Expand
  • 115
  • 6
  • PDF