|
[1] Rakesh Agrawal, Tomasz Imielinski, and Arun Swami. Mining Association Rules between Sets of Items in Large Databases. In Proc. of the ACM SIGMOD Conference on Management of Data, pages 207-216, Washington, D. C., May 1993 [2] R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules in Large Databases, Proc. 20th Int’l Conf. Very Large Data Bases, pp. 478-499, September 1994. [3] Wai-ho Au, and Keith C.C. Chan. An Effective Algorithm for Discovering Fuzzy Rules in Relational Databases. The 1998 IEEE International Conference on Fuzzy Systems Proceedings [4] S. Brin et al., Dynamic Itemset Counting and Implication Rules for Market Basket Data, Proc. ACM SIGMOD Int’l Conf. Management of Data, ACM Press, New York, 1997, pp. 255-264. [5] K.C.C. Chan, and W.H. Au. Mining Fuzzy Association Rules. In Proc. of the 6th ACM Int’l Conf. On Information and Knowledge Management (CIKM’ 97), Las Vegas, Nevada, Nov. 1997. [6] M.-S. Chen, J. Han and P. S. Yu, Data Mining: An Overview from Database Perspective, IEEE Trans. on Knowledge and Data Engineering, Vol. 8, No. 6, pp. 866-883, December 1996. [7] M. Ester, H. Kriegel, J. Sander, and X. Xu. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In Proceedings of 2nd International Conference on Knowledge Discovery Databases and Data Mining, AAAI Press, Menlo Park, Calif., 1996, pp. 226-231. [8] Usama Fayyad, and Paul Stolorz, Data mining and KDD: Promise and challenges. Future Generation Computer Systems 13(1997), 99-115 [9] Sudipto Guha, Rajeev Rastogi, and kyuseok Shim. CURE: An Efficient Clustering Algorithm for Large Databases. SIGMOD 98, Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA. [10] J. Han, and Y. Fu. Discovery of multiple-level association rules from large databases. Proc. of International Conference on Very Large Databases, Zurich, Switzerland, pp. 420-431, September 1995. [11] K. Hirota and W. Pedrycz, Linguistic data mining and fuzzy modeling, IEEE International conference on Fuzzy systems, Vol.2, 1996, pp. 1488-1496. [12] Hinneburg A., Keim D.A.: An Efficient Approach to Clustering in Multimedia Databases with Noise, Proc. 4rd Int. Conf. on Knowledge Discovery and Data Mining, New York, AAAI Press, 1998. [13] Ta-Jung Huang, and Shyue-Liang Wang. Ansering Null Queries in Fuzzy Relational Databases. 1997 Proceedings of the 8th International Conference on Information Management. [14] Chan-Sheng Kuo, A Study of Fuzzy Data Mining Algorithms for Qunatitative Value. Master thesis, Business Administration, I-Shou University, Taiwan, 1999. [15] L. Kaufman and P. J. Rousseeuw. Finding Groups in Data: an Introduction to Cluster Analysis. John Wiley & Sons, 1990. [16] George Karypis, Eui-hong Han, and Vipin Kumar, “Chameleon: Hierarchical Clustering Using Dynamic Modeling”, IEEE Computer: Special Issue on Data Analysis and Mining, vol. 32, no. 8, pp 68-75, August 1999. [17] R. Krishnapuram, and J. M. Keller. A possibilistic approach to clustering, IEEE Transactions on Fuzzy Systems Volume: 1 2, May 1993, Page(s): 98 —110. [18] Lee-Hyong Lee, and Hyung Lee-Kwang, An Extension of Association Rules Using Fuzzy Sets. IFSA ’97 [19] R.T. Ng and J. Han. Efficient and Effective Clustering Methods for Spatial Data Mining. In Proceedings of the 20th VLDB Conference, pages 144-155, 1994. [20] Vincent Ng, and John Lee. Quantitative Association Rules over Incomplete Data. 1998 IEEE Conf. on SMC. Vol. 3, 2821-2826. [21] Jong Soo Park, Ming-Syan Chen, Philip S. Yu, An Effective Hash Based Algorithm for Mining Association Rules. SIGMOD Conference 1995: 175-186 [22] J. S. Park, M. S. Chen, and P. S. Yu. Using a Hash-Based Method with Transaction Trimming for Mining Association Rules. IEEE Transactions on Knowledge and Data Engineering, Vol. 9, No. 5, September/October 1997. [23] Witold Pedrycz. Fuzzy set technology in knowledge discovery. Fuzzy Sets and Systems 98. [24] R. Srikant and R. Agrawal. Mining Generalized Association Rules. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 407-419, September 1995. [25] R. Srikant, and R. Agrawal, Mining Quantitative Association Rules in Large Relational tables. In Proc. of 1996 ACM SIGMOD Int’l Conf. on Management of Data, Monreal, Canada, June 1996, pp. 1-12. [26] Takahiko Shintani, and Masaru Kitsuregawa, Parallel Mining Algorithms for Generalized Association Rules with Classification Hierarchy. SIGMOD ’98, Seattle, WA, USA [27] G Sheikholeslami, Surojit Chatterjee, Aidong Zhang: WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases. VLDB''98, Proceedings of 24th International Conference on Very Large Data Bases, August 24-27, 1998, New York City, New York, USA. [28] A. Savasere, E. Omiecinski, and S. Navathe, An Efficient Algoritm for Mining Association Rules in Large Database, Proc. 21st Int’l Conf. Very Large Data Bases, Morgan Kaufmann, San Francisco, 1995, pp. 432-444. [29] Wei Wang, Jiong Yang, and Richard Munts. STING: A statistical information grid approach to spatial data mining. In Proceedings of the 23rd VLDB Conference, pages 186-195, Athens, Greece, 1997. [30] X. Xu, M. Ester, H.-P. Kriegel, J. Sander. A Distribution-Based Clustering Algorithm for Mining in Large Spatial Databases. In Proc. IEEE International Conference on Data Engineering, 1998. [31] Tian Zhang, Raghu Ramakrishnan, and Miron Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pages 103-114, Montreal, Canada, 1996.
|