최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Journal of Internet Computing and Services = 인터넷정보학회논문지, v.15 no.5, 2014년, pp.95 - 105
강문수 (Computer Engineering, Korea Aerospace University) , 최영식 (Computer Engineering, Korea Aerospace University)
In this paper, we present a novel ant-based hierarchical clustering algorithm, where ants repeatedly hop from one node to another over a weighted directed graph of k-nearest neighborhood obtained from a given dataset. We introduce a notion of node pheromone, which is the summation of amount of phero...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
핵심어 | 질문 | 논문에서 추출한 답변 |
---|---|---|
노드 페로몬은 무엇인가? | 본 논문에서 제안하는 ACHC(Ant Colony Hierarchical Clustering) 알고리즘은 개미들이그래프의 한 노드에서 다른 노드로 반복적으로 노드 페로몬 값이 높은 노드를 선호하여 선택하여 이동한다. 노드 페로몬은 노드로 유입 되는 에지들과 관련된 페로몬량의 합으로 정의한다. | |
Lumer 및 Faieta(LF)의 작업은 무엇인가? | Lumer 및 Faieta(LF)의 작업은 개미 기반의 데이터 클러스터링 및 정렬에 대한 일련의 작업이다. [5]와 [11]은 주제 지도의 형태로 문서 컬렉션의 이차원 시각화에 적용할 수있도록 LF 알고리즘을 수정하였고 [12]와 [13]는 그래프 분할에 적용 가능하도록 하였다. | |
노드 페로몬이 그래프에서 개미 확률적 이동을 통해 상대 밀도를 측정할 수 있는 이유는 무엇인가? | 제안하는 ACHC 알고리즘은 그래프에서 노드로 들어오는 에지 페로몬의 합인 노드 페로몬의 개념을 기반으로 한다. 노드 페로몬의 양은 노드밀도 관점에서 그 주변의 이웃과 경쟁하며 개미 수신 빈도를 반영한다. 따라서 노드 페로몬은 그래프에서 개미 확률적 이동을 통해 상대 밀도를 측정할 수 있다. |
Rui Xu and Donald Wunsch II, "Survey of Clustering Algorithms," IEEE Transactions On Neural Networks, Vol. 16, No. 3, pp. 645-678, May 2005.
Yan Yang and M. S. Kamel, "An aggregated clustering approach using multi-ant colonies algorithms," Pattern Recognition Vol. 39, Issue 7, pp. 1278-1289, July 2006.
Deneubourg, J.-L., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., and Chretien, L., "The dynamics of collective sorting: Robot-like ants and ant-like robots," in Proceedings of the First International Conference on Simulation of Adaptive Behavior: From Animals to Animats 1, 1991, pp. 356-365, Cambridge, MA: MIT Press.
Lumer, E. and Faieta, B., "Diversity and adaptation in populations of clustering ants," in Proceedings of the Third International Conference on Simulation of Adaptive Behavior: From Animals to Animats 3, pp. 501-508, Cambridge, MA: MIT Press.
Handl, J. and Meyer, B., "Improved ant-based clustering and sorting in a document retrieval interface," in Proceedings of the Seventh International Conference on Parallel Problem Solving from Nature, 2002, Vol. 2439 of Lecture Notes in Computer Science, pp.913-923. Berlin, Germany: Springer-Verlag.
Handl, J., Knowles, J., and Dorigo M., "Ant-based clustering and topographic mapping," Artificial Life, Vol. 12, No. 1, pp. 35-62, 2006.
Shang Liu, Zhi-Tong Dou, Fei Li, Ya-Lou Huang, "A New Ant Colony Clustering Algorithm Based on DBSCAN," in Machine Learning and Cybernetics, Proc. of 3th International Conf., 2004, vol. 3, pp 1491-1496.
N. Monmarche, M. Slimane, G. Venturini, "AntClass: discovery of clusters in numeric data by a hybridization of an ant colony with the K-means algorithm," Internal Report No 213, France, Jan. 1999.
Ling Chen, Li Tu, Hong-Jian Chen, "Data Clustering by Ant Colony on a Digraph," in Machine Learning and Cybernetics, Proc. of 4th International Conf., Guangzhou Aug. 18-21, 2005, vol. 3, pp 1686-1692.
Gunjan Gupta, Alexander Liu, Joydeep Ghosh, "Hierarchical Density Shaving: A clustering and visualization framework for large biological datasets," in Proc. 6th IEEE International Conf. on Data, Washington, 2006, pp 89-93.
Ramos, V. and Merelo, J., "Self-organized stigmergic document maps: Environment as a mechanism for context learning," in Proceedings of the First Spanish Conference on Evolutionary and Bio-Inspired Algorithms, Spain, 2002, pp. 284-293.
Kuntz, P and Snyers, D., "Emergent colonization and graph partitioning," in Proceedings of the Third International Conference on Simulation of Adaptive Behavior: From Animals to Animats 3, 1994, pp. 494-500, Cambridge, MA: MIT Press.
Kuntz, P and Snyers, D., "New results on an ant-based heuristic for highlighting the organization of large graphs," in Proceedings of the Congress of Evolutionary Computation, 1999, pp. 1451-1458, IEEE Press.
Gupta G, Liu A, Ghosh J., "Automated hierarchical density shaving: a robust automated clustering and visualization framework for large biological data sets.",IEEE/ACM Trans Comput Biol Bioinform. 2010 Apr-Jun;7(2):223-237
KiYoung Lee, Dae-Won Kim, K. H. Lee, and D. Lee, "Density-Induced Support Vector Data Description," IEEE Transactions on Neural Networks, Vol. 18, No. 1, pp. 284-289, January 2007.
Marco Dorigo and Thomas Stutzle, Ant Colony Optimization, MIT Press, 2004.
Soumen Chakrabarti, mining the Web: Discovering Knowledge from Hypertext Data, Morgan Karufmann Publishers, 2003.
Richard O. Duda, Peter E. Hart, and David G. Stork, Pattern Classification, John Wiley & Sons, 2001.
Blake, C. and Merz, C. UCI repository of machine learning databases, Technical report, Department of Information and Computer Sciences, University of California, Irvine.
M. Halkidi, M. Vazirgiannis, and I. Batistakis, "Quality scheme assessment in the clustering process," in Proceedings of the Fourth European Conference on Principles of Data Mining and Knowledge Discovery, Vol. 1910 of Lecture Notes in Computer Science, pp. 265-267, 2000.
J. Han and M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, 2006.
Debajit Sensarma, Koushik Majumder, "A Novel Hierarchical Ant based QoS aware Intelligent Routing Scheme for MANETS", International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Hanene Azzag, Gilles Venturini, Antoine Oliver and Christiane Guinot, "A hierarchical ant based clustering algorithm and its use in three real-world applications", European Journal of Operational Research, Vol. 179, Issue 3, 16 June 2007, pp. 906-922
J. Chircop and C. D Buckingham, "A Multiple Pheromone Ant Clustering Algorithm", Proceedings of NICSO 2013, to be published in Studies in Computational Intelligence, Springer, 2013
Jan Chircop, Christopher D. Buckingham, "The Multiple Pheromone Ant Clustering Algorithm and its application to real world domains", Proceedings of the 2013 Federated Conference on Computer Science and Information Systems pp. 27-34
Kumar V and Balasubramanie P, "Ant Colony Optimization Using Hierarchical Clustering in Mobile Ad Hoc Networks", European Journal of Scientific Research, 2011, Vol. 61 Issue 4, p549-560.
O.A. Mohamed Jafar and R. Sivakumar, "Ant-based Clustering Algorithms: A Brief Survey" ,International Journal of Computer Theory and Engineering, Vol. 2, No. 5, October, 2010, 1793-8201
Wafa'a Omar, Amr Badr and Abd El-Fattah Hegazy, "Hybrid Ant-Based Clustering Algorithm With Cluster Analysis Techniques", Journal of Computer Science 9(6): 780-793, 2013
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
출판사/학술단체 등이 한시적으로 특별한 프로모션 또는 일정기간 경과 후 접근을 허용하여, 출판사/학술단체 등의 사이트에서 이용 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.