732 search results - page 57 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
VLDB
1999
ACM
14 years 3 days ago
1999
ACM
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
INCDM
2010
Springer
13 years 12 months ago
2010
Springer
This paper reports on a mechanism to identify temporal spatial trends in social networks. The trends of interest are defined in terms of the occurrence frequency of time stamped p...
ISCI
2008
13 years 7 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
DASFAA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. In this paper, an efficient strategy for mining top-K non-trivial faulttolerant repeating patterns (FT-RPs in short) with lengths no less than min_len from data sequences...
KAIS
2008
13 years 7 months ago
2008
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...