Sciweavers

152 search results - page 16 / 31
» Mining Closed Sequential Patterns with Time Constraints
Sort
View
SYRCODIS
2007
99views Database» more  SYRCODIS 2007»
13 years 8 months ago
Association Rules Discovery in Multivariate Time Series
A problem of association rules discovery in a multivariate time series is considered in this paper. A method for finding interpretable association rules between frequent qualitati...
Elena Lutsiv
KES
2004
Springer
14 years 28 days ago
Mining Frequency Pattern from Mobile Users
Group pattern was introduced to find groups of mobile users associated by means of physical distance and amount of time spent together. This paper addresses the inherent problem of...
John Goh, David Taniar
DIS
2007
Springer
13 years 11 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
SAC
2004
ACM
14 years 1 months ago
A new algorithm for gap constrained sequence mining
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Salvatore Orlando, Raffaele Perego, Claudio Silves...
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
13 years 9 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane