Chung-Sheng Li
Philip S. Yu
- 1.AGRAWAL, R., FALOUTSOS, C., AND SWAMi, A. Efficient simfiarity search in sequence database. In Fourth International Conference on Foundations of Data Organization and Algorithms (Oct. 1993). Google Scholar
Digital Library
- 2.AGRAWAL, R., IMmLn~SKX, T., AND SWAMI, A. Database mining: A performance perspective. IEEE Transactions on 'Knowledge and Data Engineering- special issue on Learning and Discovery in Knowledge-Based Databases (1993). Google ScholarDigital Library
- 3.AGRAWAL, R., LIN, K., SAWHNBY, H. S., AND SHIM, K. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In Proc. of the ~lst Int'l Conference on Very Large Databases (September 1995). Google ScholarDigital Library
- 4.AOP. AWAL, R., PSAILA, G., WIMMBRS, E. L., AND ZAIT, M. Querying shapes of histories. In Proc. VLDB (~995). Google ScholarDigital Library
- 5.AL-TAHA, K. K., SNODGRAS$, R. T., AND Soo, M. D. Bibliography on spatiotemporal databases. A CM SIG- MOD Record ~~, 1 (March 1993), 59-67. Google ScholarDigital Library
- 6.BOLLOBAS, B., DAS, G., AND GUNOPULOS, D. Timeseries similarity problems and well-separated geometric sets. In 13th A CM Symposium on Computational Geometry (1997). Google ScholarDigital Library
- 7.DAS, G., GUNOPULOS, D., AND MANNa, A, H. Finding similar time series. In PKDD'97 (1997). Google ScholarDigital Library
- 8.FALOUTSOS, C., AND Ln~, K.-I. Fastmap: A fast algorithm for indexing, data mining, and visualization of traditional and multimedia datasets. In Proc. SIG- MOD'95 (1995), pp. 163-174. Google ScholarDigital Library
- 9.FALOUTSO$, C., RANGANATHAN, M., AND MANOLOPOULOS, Y. Fast subsequence matching in time-series databases. In Proc. SIGMOD'94 (1994), pp. 419-429. Google ScholarDigital Library
- 10.FAMA, E. F. The behavior of stock market prices. Journal of Business (Jan. 1965), 34-105.Google Scholar
- 11.KSOGH, E. Fast similarity search in the presence of longitudinal scaling of time series databases. In Proc. IEEE International Conferences on Tools with Artificial intelligence (1997), pp. 578-584. Google ScholarDigital Library
- 12.KOHONBN, T., OJA, E., S~ULA, O., VISA, A., AND KANGAS, J. Engineering applications of the self organizing map. Proc. of the IEEE 84, 10 (October 1996), 1358-1384. Google ScholarDigital Library
- 13.LI, C.-S., CASTELLI, V., AND YU, P. S. Hierarchyscan: A hierarchical similarity search algorithm for databases of long sequences. In Proc. ICDE (1996). Google ScholarDigital Library
- 14.Lu, W., HAN, J., AND Oox, B. Discovery of general knowledge in large spatial databases. In Proc. Far East Workshop on Geographic Information Systems (1993), pp. 275-289.Google Scholar
- 15.OsBoa.~rE, M. Brownian motion in the stock market. Operations Research (March-April 1959).Google Scholar
- 16.RAFmi, D., AND Mn. NDBLZON, A. Similarity based queries for time series data. In SIGMOD (1997), pp. 13- 25. Google ScholarDigital Library
- 17.SHATKAY, H., AND ZDONrK, S. B. Approximate queries and representations for large data sequences. In Proc. Icor (~996). Google ScholarDigital Library
- 18.STAM, R., AND SNODaRASS, R. A bibliography on temporal databases. IEEE Bulletin on Data Engineering 11, 4 (Dec. 1988).Google Scholar
Index Terms
- MALM: a framework for mining sequence database at multiple abstraction levels
Recommendations
Efficient algorithms for mining high-utility itemsets in uncertain databases
High-utility itemset mining (HUIM) is a useful set of techniques for discovering patterns in transaction databases, which considers both quantity and profit of items. However, most algorithms for mining high-utility itemsets (HUIs) assume that the ...
Effective database transformation and efficient support computation for mining sequential patterns
AbstractIn this paper, we propose a novel algorithm for mining frequent sequences from transaction databases. The transactions of the same customers form a set of customer sequences. A sequence (an ordered list of itemsets) is frequent if the number of ...
Comments