4 papers
Mining Patterns with a Balanced Interval
Edgar de Graaf Joost Kok Walter Kosters
In many applications it will be useful to know those patterns that occur with a balanced interval, e.g., a certain combination of phone numbers are called almost every Friday or a…
Clustering with Lattices in the Analysis of Graph Patterns
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
Mining frequent subgraphs is an area of research where we have a given set of graphs (each graph can be seen as a transaction), and we search for (connected) subgraphs contained in…
Clustering Co-occurrence of Maximal Frequent Patterns in Streams
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
One way of getting a better view of data is using frequent patterns. In this paper frequent patterns are subsets that occur a minimal number of times in a stream of itemsets. Howev…
Consecutive Support: Better Be Close!
Edgar de Graaf, Jeannette de Graaf, Walter A. Kosters
We propose a new measure of support (the number of occur- rences of a pattern), in which instances are more important if they occur with a certain frequency and close after each ot…