RSS
热门关键字:  数据挖掘  数据仓库  商业智能  人工智能  搜索引擎

Mining Time-Series

来源: 作者:unkonwn 时间:2004-12-04 点击:
  1. R. Agrawal, K.-I. Lin, H.S. Sawhney, and K. Shim. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In VLDB′95, pp. 490-501, Zurich, Switzerland, Sept. 1995.
  2. Y.-S. Moon, K.-Y. Whang, W.-K. Loh.  Duality-Based Subsequence Matching in Time-Series Databases., Proc. 2001 Int. Conf. Data Engineering (ICDE′01), Heidelberg, Germany, pp. 263-272, April 2001
  3. R. Agrawal, G. Psaila, E. L. Wimmers, and M. Zait. Querying shapes of histories. In VLDB′95, pp. 502-514, Zürich, Switzerland, Sept. 1995.
  4. Michail Vlachos, Chris Meek, Zografoula Vagena, Dimitrios Gunopulos, Identifying Similarities, Periodicities and Bursts for Online Search Queries, SIGMOD’04, pp. 213-224
Mining Sequential Patterns
5.      R. Agrawal and R. Srikant. Mining sequential patterns. In ICDE′95, pp. 3-14, Taipei, Taiwan, March 1995.
  1. Mannila H.; Toivonen H.; Inkeri Verkamo A., Discovery of Frequent Episodes in Event Sequences. Data Mining and Knowledge Discovery, 1997, vol. 1, no. 3, pp. 259-289(31)
  2. M. Garofalakis, R. Rastogi, and K. Shim. SPIRIT: Sequential pattern mining with regular expression constraints. In Proc. 1999 Int. Conf. Very Large Data Bases (VLDB′99), pp. 223-234, Edinburgh, UK, Sept. 1999.
  3. J. Pei, J. Han, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. , Proc. 2001 Int. Conf. on Data Engineering (ICDE′01), Heidelberg, Germany, April 2001.
  4. J. Han, G. Dong, and Y. Yin. Efficient mining of partial periodic patterns in time series database. In ICDE′99, pp. 106-115, Sydney, Australia, April 1999.
  5. J. Pei, J. Han, and W. Wang, “Mining Sequential Patterns with Constraints in Large Databases”, Proc. 2002 Int. Conf. on Information and Knowledge Management (CIKM′02)}, Washington, D.C., Nov. 2001.
  6. X. Yan, J. Han, and R. Afshar, “CloSpan: Mining Closed Sequential Patterns in Large Datasets”, Proc. 2003 SIAM Int. Conf. on Data Mining (SDM′03), San Fransisco, CA, May 2003.
  7. P. Tzvetkov, X. Yan, and J. Han, “TSP: Mining Top-K Closed Sequential Patterns”, Proc. 2003 Int. Conf. on Data Mining (ICDM′03), Melbourne, FL, Nov. 2003.
  8. J. Wang and J. Han, “BIDE: Efficient Mining of Frequent Closed Sequences”, Proc. 2004 Int. Conf. on Data Engineering (ICDE′04), Boston, MA, March 2004.
最新评论共有 0 位网友发表了评论
发表评论
评论内容:不能超过250字,需审核,请自觉遵守互联网相关政策法规。
匿名?