메뉴 건너뛰기




Volumn 54, Issue 11-12, 2007, Pages 1303-1318

Association rule mining through the ant colony system for National Health Insurance Research Database in Taiwan

Author keywords

Ant colony system; Apriori; Data mining; Multiple dimensional constraints

Indexed keywords

ASSOCIATION RULES; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL METHODS; CONSTRAINT THEORY; DATABASE SYSTEMS;

EID: 35748958418     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2006.03.043     Document Type: Article
Times cited : (49)

References (28)
  • 1
    • 35748930073 scopus 로고    scopus 로고
    • R. Srikant, Q. Vu, R. Agrawal, Mining association rules with item constraints, in: Proc. Int. Conf. Knowledge Discovery and Data, KDD'97, Boston, MA, 1997, pp. 67-73
  • 2
    • 35748933989 scopus 로고    scopus 로고
    • J.-F. Boulicaut, B. Jeudy, Using constraint for set mining: Should we prune or not? in: Proceedings Bases de Données Avançées, BDA'00, France, Oct. 2000, pp. 221-237
  • 3
    • 0034592924 scopus 로고    scopus 로고
    • J. Pei, J. Han, Can we push more constraints into frequent pattern mining? in: Proc. Int. Conf. Knowledge Discovery and Data Mining, KDD'00, Boston, MA, Aug. 2000, pp. 350-354
  • 4
    • 0035016447 scopus 로고    scopus 로고
    • J. Pei, J. Han, L.V.S. Lakshmanan, Mining frequent itemsets with convertible constraints, in: Proc. IEEE Int. Conf. Data Engineering, ICDE'01, Heidelberg, Germany, Feb. 2001, pp. 433-442
  • 7
    • 35748942082 scopus 로고    scopus 로고
    • M. Dorigo, V. Maniezzo, A. Colorni, Positive feedback as a search strategy, Technical Report Dissertation, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1991, pp. 91-116
  • 9
    • 35748938566 scopus 로고    scopus 로고
    • B. Bullnheimer, R.F. Hartl, C. Strauss, A new rank-based version of the ant system a computational study, Technical Report POM-03/97, Institute of Management Science, University of Vienna, Austria, 1997, pp. 25-38
  • 10
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • Dorigo M., and Gambardella L.M. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1 (1997) 53-66
    • (1997) IEEE Transactions on Evolutionary Computation , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 15
    • 0027621699 scopus 로고    scopus 로고
    • R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proc. ACM-SIGMOD Int. Conf. Management of Data, SIGMOD'93, Washington, USA, May 1993, pp. 207-216
  • 16
    • 0027883358 scopus 로고
    • Database mining: A performance perspective, (Learning and discovery in knowledge-based databases)
    • (Special issue)
    • Agrawal R., Imielinski T., and Swami A. Database mining: A performance perspective, (Learning and discovery in knowledge-based databases). IEEE Transactions on Knowledge and Data Engineering 5 6 (1993) 914-925 (Special issue)
    • (1993) IEEE Transactions on Knowledge and Data Engineering , vol.5 , Issue.6 , pp. 914-925
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 17
    • 35748978951 scopus 로고    scopus 로고
    • J. Han, J. Pei, Mining frequent patterns by pattern-growth: Methodology and implications, ACM SIGKDD Explorations Newsletter, 2000, pp. 14-20
  • 19
    • 35748951441 scopus 로고    scopus 로고
    • H. Toivonen, Sampling large databases for association rules, in: Proceedings of the International Conference on Very Large Data Bases, Mumbai (Bombay), India, 1996, pp. 134-145
  • 21
    • 0036565197 scopus 로고    scopus 로고
    • Pincer-Search: An efficient algorithm for discovering the maximum frequent set
    • Lin D., and Kedem Z. Pincer-Search: An efficient algorithm for discovering the maximum frequent set. IEEE Transactions on Knowledge and Data Engineering 14 3 (2002) 553-566
    • (2002) IEEE Transactions on Knowledge and Data Engineering , vol.14 , Issue.3 , pp. 553-566
    • Lin, D.1    Kedem, Z.2
  • 22
    • 0032091573 scopus 로고    scopus 로고
    • R.J. Bayardo, Efficiently mining long patterns from database, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, USA, 1998, pp. 85-93
  • 23
    • 35748986549 scopus 로고    scopus 로고
    • A. Savasere, E. Omiecinski, S. Navathe, An efficient algorithm for mining associate rules in large databases, in: Proceedings of the International Conference on Very Large Data Bases, Zurich, Switzerland, 1995, pp. 432-444
  • 24
    • 35748963643 scopus 로고    scopus 로고
    • S. Rafael Parpinelli, S. Heitor Lopes, A. Alex Freitas, An ant colony based system for data mining: Applications to medical data, in: Proc. Int. Conf. Knowledge Discovery and Data, Boston, MA, 2000, pp. 55-62
  • 25
    • 84964452116 scopus 로고    scopus 로고
    • B. Wu, Z. Shi, A clustering algorithm based on swarm intelligence, in: Proceedings of International Conference on Info-tech and Info-net, vol. 3, Beijing, Oct. 2001, pp. 58-66
  • 26
    • 34547504064 scopus 로고    scopus 로고
    • W.M. Teles, L. Weigang, C.G. Ralha, AntWeb - the adaptive web server based on the ants' behavior, in: Proceedings of IEEE/WIC International Conference on Wed Intelligence, Oct. 2003, pp. 558-561
  • 27
    • 35748975255 scopus 로고    scopus 로고
    • B.D. Su, Discovering association rules through ant systems, Master Thesis of National Chin-Hwa Univeristy, Taiwan, ROC, 2002
  • 28
    • 0001235540 scopus 로고    scopus 로고
    • An analysis of several heuristics for the traveling salesman problem
    • Rosenkrantz D.J., Stearns R.E., and Lewis P.M. An analysis of several heuristics for the traveling salesman problem. SIAM Journal of Computing 6 3 (1997) 563-581
    • (1997) SIAM Journal of Computing , vol.6 , Issue.3 , pp. 563-581
    • Rosenkrantz, D.J.1    Stearns, R.E.2    Lewis, P.M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.