Sciweavers

2995 search results - page 181 / 599
» On multi-avoidance of generalized patterns
Sort
View
KDD
2007
ACM
137views Data Mining» more  KDD 2007»
14 years 9 months ago
Characterising the difference
Characterising the differences between two databases is an often occurring problem in Data Mining. Detection of change over time is a prime example, comparing databases from two b...
Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 9 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 9 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
MOBISYS
2007
ACM
14 years 8 months ago
Surface street traffic estimation
In this paper, we propose a simple yet effective method of identifying traffic conditions on surface streets given location traces collected from on-road vehicles--this requires o...
Jungkeun Yoon, Brian Noble, Mingyan Liu
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 4 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu