• Title/Summary/Keyword: 집합기억

Search Result 35, Processing Time 0.021 seconds

RAG-based Hierarchical Classification (RAG 기반 계층 분류 (2))

  • Lee, Sang-Hoon
    • Korean Journal of Remote Sensing
    • /
    • v.22 no.6
    • /
    • pp.613-619
    • /
    • 2006
  • This study proposed an unsupervised image classification through the dendrogram of agglomerative clustering as a higher stage of image segmentation in image processing. The proposed algorithm is a hierarchical clustering which includes searching a set of MCSNP (Mutual Closest Spectral Neighbor Pairs) based on the data structures of RAG(Regional Adjacency Graph) defined on spectral space and Min-Heap. It also employes a multi-window system in spectral space to define the spectral adjacency. RAG is updated for the change due to merging using RNV (Regional Neighbor Vector). The proposed algorithm provides a dendrogram which is a graphical representation of data. The hierarchical relationship in clustering can be easily interpreted in the dendrogram. In this study, the proposed algorithm has been extensively evaluated using simulated images and applied to very large QuickBird imagery acquired over an area of Korean Peninsula. The results have shown it potentiality for the application of remotely-sensed imagery.

Application and Comparison of Genetic Algorithm and Harmony Search Algorithm for Optimal Cost Design of Water Distribution System (상수도 관망 최적설계에 대한 유전 알고리즘과 하모니써치 알고리즘의 적용 및 비교)

  • Hong, Ari;Lee, Ho Min;Choi, Young Hwan;Choi, Ji Ho;Kim, Joong Hoon
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2016.05a
    • /
    • pp.521-521
    • /
    • 2016
  • 상수도 관망은 수원에서 수요절점까지 물을 안정적으로 공급하는 것을 목표로 한다. 상수도 관망의 최적설계는 수리학적 제한조건 (절점의 수압, 관로의 유속)을 만족하는 범위에서 비용을 최소화하는 설계안을 얻는 것으로 Savic and Walters (1997)는 유전 알고리즘 (Genetic Algorithms, Holland 1975)을 적용한 상수도 관망 설계 프로그램인 GANET를 제안하였고, Maier et al. (1996)은 개미군집알고리즘 (Ant Colony Optimization Algorithm, Dorigo et al. 1996)을 상수도 관망 최적설계에 적용한 후 그 결과가 유전 알고리즘에 비해 우수함을 증명하는 등 상수도 관망 최적설계에 관한 연구가 활발히 진행되어 오고 있다. 유전알고리즘은 선택, 교차, 돌연변이의 반복계산 과정을 통하여 최적해를 찾는 최적화 기법이다. 이 과정에서 결정변수는 유전자 (Gene)의 집합으로 표현되며, 염색체 (Chromosome) 내에서 근접한 유전 인자들은 일종의 Building Block을 형성하게 된다. Building Block은 좋은 해를 갖는 유전 인자를 높은 확률로 보관하여 지역해에 빠질 가능성을 줄이는 반면, 유전형 (Genotype)이 표현형 (Phenotype)을 충분히 모방하여 표현하지 못한 경우 오히려 최적해의 탐색을 방해할 수 있다는 한계점을 갖는다. 유전 알고리즘을 상수도 관망 최적설계에 적용하였을 때에도 이 한계점은 여실히 드러난다. 관로의 관경을 결정변수로 설정한 후 유전형으로 표현하였을 때, 관망도 상에서 근접하지 않은 두 관로가 염색체 내에서 연속으로 나열된다면 두 관로 간의 연관성이 실제보다 크게 고려되기 때문이다. 한편, 하모니써치 (Harmony Search, Geem et al. 2001) 알고리즘은 즉흥 연주 (Improvisation)를 통해 최상의 화음을 만들어내는 현상으로부터 착안하여 만들어진 최적화기법으로 연산 기법은 무작위선택, 기억회상, 피치조정 등으로 구성되어 있으며, 결정변수에 해당하는 연주자가 독립적으로 행동하며 해를 탐색한다는 점에서 유전알고리즘과 큰 차이를 갖는다. 본 연구에서는 유전알고리즘의 Building Block에 의해 발생하는 오류를 개선하고자, 상수도 관망 최적설계 연구에 많이 사용되는 Hanoi 관망 (Fujiwara and Khang 1990) 관로의 정렬 순서를 여러 가지 기준으로 설정하여 관망데이터를 구축한 후 하모니써치와 유전 알고리즘을 적용하여 최적화를 수행하였고 그 결과를 비교하였다. 그 결과 유전 알고리즘과 달리 하모니써치 알고리즘의 경우, 관로의 나열 순서와 상관없이 우수한 최적해 탐색 결과를 보이는 것을 확인할 수 있었다.

  • PDF

On the study of 'Theater State' in Daehan Empire of the Emperor Gochung -analyzing the cultural performance with the visual spectacles- (대한제국기 극장국가(theater state) 연구(2) -스펙터클의 문화사회사적 분석을 통한 문화적 퍼포먼스 고찰의 한 방법-)

  • Kim, Kiran
    • Journal of Korean Theatre Studies Association
    • /
    • no.40
    • /
    • pp.125-162
    • /
    • 2010
  • This is the study on the 'Theater State' in the Daehan Empire of the Emperor Gochung in the late 1900 with the theatrical concepts of cultural performance theory which has been useful for investigating historical, social, and cultural collective memories and their transformation mechanism in the society. The performance theory is based in the notion, '$Performativit{\ddot{a}}t$', by which the performance can contain vary performance forms. $Performativit{\ddot{a}}t$ is the notion which points up the certain process that can cause the perceptional emotion communication to the performers and audiences in the performance. The spectacle of a society is also understood and presupposed by the $Performativit{\ddot{a}}t$. Generally speaking, the spectacle has been used of explaining the visual cultural experiences in society. Fundamentally, spectacle had resulted from the latin 'spectaculum', which was used to designate theatrical representation in France. In the case of movie, spectacle was the grand show with showy technological attractions. The spectacle have been to show the political and socio-historical relationships in a society. But in my study, I want to start the premise that the cultural performance planed by the Emperor Gochung in the Daehan Empire has the attribute of 'theater state', which can awaken the certain collective emotion to connect the Emperor and his people in the Daehan Empire period of the Emperor Gochung of the late 1900. In addition to it, I search for the historical collective memories of the Daehan Empire. The government of the Daehan Empire was continuing with its efforts to enforce and recollect the imperial images and authority of the Emperor and his Empire to get the approval of the people and international society. The effect of spectacle consisting of theater state was the concrete effort to establish the collective memories of the Daehan Empire by remodelling and rebuilding the Seoul, the capital of the Empire and performing the national ceremony such as the korean pagent(Gae-Dung거둥) and parade to set the portrait of the Emperor(A-Jin어진), the geo-body of the Empire.

Mania Construction and Constitution based on Animation 'Full metal Alchemist's Character (애니메이션 '강철의 연금술사' 의 캐릭터를 중심으로 한 매니아 형성과 구조)

  • Park, Yoon-Sung;Kim, Hye-Sung;Lee, Ga-Young
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.12
    • /
    • pp.253-260
    • /
    • 2006
  • As media and product became variety, the propensity of the people is be coming various. From diversity, there we could search for some popularity is called 'the mania.' When Mania takes shape, the product will being longer even masses in these days only have short-term life. Also there are hundreds of animations that has short-term life whom people forgot everyday they watch. However, the animations could lasting its value which has the Mania. This thesis is a studies on the constitution of Mania from animation 'Fullmetal Alchemist's Character The BONES had made. We can learn that the audience were not just like the animation, but get crazy for it by comparing Japanese animation industry in those days; before it has been shrinking and manufacturing various contents from Fullmetal Alchemist means there is enough consumtions. There are many reasons to form Mania group, but specially the character symbols at the works as a whole. From this study is to know a cause of how the animation 'Fullmetal Alchemist' made huge Mania group, and significance value of the work those group left.

  • PDF

Feasibility of Deep Learning Algorithms for Binary Classification Problems (이진 분류문제에서의 딥러닝 알고리즘의 활용 가능성 평가)

  • Kim, Kitae;Lee, Bomi;Kim, Jong Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.23 no.1
    • /
    • pp.95-108
    • /
    • 2017
  • Recently, AlphaGo which is Bakuk (Go) artificial intelligence program by Google DeepMind, had a huge victory against Lee Sedol. Many people thought that machines would not be able to win a man in Go games because the number of paths to make a one move is more than the number of atoms in the universe unlike chess, but the result was the opposite to what people predicted. After the match, artificial intelligence technology was focused as a core technology of the fourth industrial revolution and attracted attentions from various application domains. Especially, deep learning technique have been attracted as a core artificial intelligence technology used in the AlphaGo algorithm. The deep learning technique is already being applied to many problems. Especially, it shows good performance in image recognition field. In addition, it shows good performance in high dimensional data area such as voice, image and natural language, which was difficult to get good performance using existing machine learning techniques. However, in contrast, it is difficult to find deep leaning researches on traditional business data and structured data analysis. In this study, we tried to find out whether the deep learning techniques have been studied so far can be used not only for the recognition of high dimensional data but also for the binary classification problem of traditional business data analysis such as customer churn analysis, marketing response prediction, and default prediction. And we compare the performance of the deep learning techniques with that of traditional artificial neural network models. The experimental data in the paper is the telemarketing response data of a bank in Portugal. It has input variables such as age, occupation, loan status, and the number of previous telemarketing and has a binary target variable that records whether the customer intends to open an account or not. In this study, to evaluate the possibility of utilization of deep learning algorithms and techniques in binary classification problem, we compared the performance of various models using CNN, LSTM algorithm and dropout, which are widely used algorithms and techniques in deep learning, with that of MLP models which is a traditional artificial neural network model. However, since all the network design alternatives can not be tested due to the nature of the artificial neural network, the experiment was conducted based on restricted settings on the number of hidden layers, the number of neurons in the hidden layer, the number of output data (filters), and the application conditions of the dropout technique. The F1 Score was used to evaluate the performance of models to show how well the models work to classify the interesting class instead of the overall accuracy. The detail methods for applying each deep learning technique in the experiment is as follows. The CNN algorithm is a method that reads adjacent values from a specific value and recognizes the features, but it does not matter how close the distance of each business data field is because each field is usually independent. In this experiment, we set the filter size of the CNN algorithm as the number of fields to learn the whole characteristics of the data at once, and added a hidden layer to make decision based on the additional features. For the model having two LSTM layers, the input direction of the second layer is put in reversed position with first layer in order to reduce the influence from the position of each field. In the case of the dropout technique, we set the neurons to disappear with a probability of 0.5 for each hidden layer. The experimental results show that the predicted model with the highest F1 score was the CNN model using the dropout technique, and the next best model was the MLP model with two hidden layers using the dropout technique. In this study, we were able to get some findings as the experiment had proceeded. First, models using dropout techniques have a slightly more conservative prediction than those without dropout techniques, and it generally shows better performance in classification. Second, CNN models show better classification performance than MLP models. This is interesting because it has shown good performance in binary classification problems which it rarely have been applied to, as well as in the fields where it's effectiveness has been proven. Third, the LSTM algorithm seems to be unsuitable for binary classification problems because the training time is too long compared to the performance improvement. From these results, we can confirm that some of the deep learning algorithms can be applied to solve business binary classification problems.