• 제목/요약/키워드: Cluster validity

검색결과 161건 처리시간 0.023초

과학 탐구능력 측정을 위한 표준화 검사지 개발 - 중학교 2학년의 자료 분석과 해석 능력을 중심으로 - (The Development of A Standardized Test of Science Inquiry Skills : Interpreting and Analyzing Data for Eighth Grade Students)

  • 이연우;우종옥
    • 한국과학교육학회지
    • /
    • 제11권1호
    • /
    • pp.59-72
    • /
    • 1991
  • This study has formed a clear definition of the elements of inquiry skills : inference, determining relationship, causal explanation, prediction, and created the goals of assessment and the items of assessment. They have been checked the validity and the objectivity and the clarity of the items by six professors of science education. At the same time, the two times of the field trial has been executed. and checked the discriminating power and the difficulty index and the effectiveness of distracters, and modified the items. The test developed in this way was administered to 1060 students of the eighth grade, randomly cluster-sampled from the universe, and standardized. The test is the aptitude test as well as the norm-reference test. and has twenty items. The testing-time is thirty minutes. And the cotent validity is 85%, the objectivity of the answer keys 91.7%, the mean of items difficulty 68.8%, the mean of discriminating power 0.39, the standard deviation 3.31, the reliability(K-R 20) 0.69. Because it is the standardized lest, it can diagnose the well-developed skills and the ill-developed skills of the students, and monitor the development of skills.

  • PDF

AMI로부터 측정된 전력사용데이터에 대한 군집 분석 (Clustering load patterns recorded from advanced metering infrastructure)

  • 안효정;임예지
    • 응용통계연구
    • /
    • 제34권6호
    • /
    • pp.969-977
    • /
    • 2021
  • 본 연구에서는 Hierarchical K-means 군집화 알고리즘을 이용해 서울의 A아파트 가구들의 전력 사용량 패턴을 군집화 하였다. 차원을 축소해주면서 패턴을 파악할 수 있는 Hierarchical K-means 군집화 알고리즘은 기존 K-means 군집화 알고리즘의 단점을 보완하여 최근 대용량 전력 사용량 데이터에 적용되고 있는 방법론이다. 본 연구에서는 여름 저녁 피크 시간대의 시간당 전력소비량 자료에 대해 군집화 알고리즘을 적용하였으며, 다양한 군집 개수와 level에 따라 얻어진 결과를 비교하였다. 결과를 통해 사용량에 따라 패턴이 군집화 됨을 확인하였으며, 군집화 유효성 지수들을 통해 이를 비교하였다.

속성유사도에 따른 사회연결망 서브그룹의 군집유효성 (Clustering Validity of Social Network Subgroup Using Attribute Similarity)

  • 윤한성
    • 디지털산업정보학회논문지
    • /
    • 제17권1호
    • /
    • pp.75-84
    • /
    • 2021
  • For analyzing big data, the social network is increasingly being utilized through relational data, which means the connection characteristics between entities such as people and objects. When the relational data does not exist directly, a social network can be configured by calculating relational data such as attribute similarity from attribute data of entities and using it as links. In this paper, the composition method of the social network using the attribute similarity between entities as a connection relationship, and the clustering method using subgroups for the configured social network are suggested, and the clustering effectiveness of the clustering results is evaluated. The analysis results can vary depending on the type and characteristics of the data to be analyzed, the type of attribute similarity selected, and the criterion value. In addition, the clustering effectiveness may not be consistent depending on the its evaluation method. Therefore, selections and experiments are necessary for better analysis results. Since the analysis results may be different depending on the type and characteristics of the analysis target, options for clustering, etc., there is a limitation. In addition, for performance evaluation of clustering, a study is needed to compare the method of this paper with the conventional method such as k-means.

소화성궤양환자의 통증표현양상에 관한 연구 (A study on Pain Express Pattern of Peptic Ulcer Patient)

  • 김정선;최영희
    • 대한간호학회지
    • /
    • 제21권2호
    • /
    • pp.230-246
    • /
    • 1991
  • Pain is a subjective and multidemensional concept. Therefore the patient's expression of pain have been referedl to the best believable indicator of pain condition but the support data obtained from the patient considered cultural difference is a deficient condition in determinded on the precise nursing diagnosis. The purpose of this reasearch was to understand multiple pain reponses in cultural difference and sensitivity, to encourage communication between medical teams, and to provide the foundation data of on data of precise nursing assessment for the patient in pain. The research problem was to grasp pain express pattern of Korean peptic ulcer patients. The subjects were 20 peptic ulcer patients in medical unit or OPD of twp university hospitals in Seoul. Data were collected from September 7th to 22nd, 1990 by intensive interviews. Interviews were done by the researcher and all were tape - recorded. The Data analysis was done by Phenomenological method from Van Kaam. Validity assured by confirmation of the internal consistency of the statements and catigory by nursing collegue in educational and clinicions in medical care. From the emic data, 96 descriptive statements were organized in 18 theme cluster. The results of study were summerized as follows. 1. Pain Express Pattern cluster of Peptic Ulcer Patients were “Pain as clogging”, “shallow pain”, “pain as pressing”, “nauseating pain”, “pain as smarting”, “pain as pulling”, “pain as pricking”, “pain as bursting”, “wrenching pain”, “excising pain”, “uncontrollable pain for mind and body”, “awakening pain”, “pain as hollowing” and the other cluster. As above mentioned, Pain Express Pattern of Peptic Ulcer Patient appeared diversely in verbal and they were propered to Korean culture. Therefore they will provide for the foundation data of precise nursing assessment.

  • PDF

군집분석 비교 및 한우 관능평가데이터 군집화 (A Comparison of Cluster Analyses and Clustering of Sensory Data on Hanwoo Bulls)

  • 김재희;고윤실
    • 응용통계연구
    • /
    • 제22권4호
    • /
    • pp.745-758
    • /
    • 2009
  • 자발적인 군집을 유도하는 다변량 통계기법으로 널리 사용되는 군집분석은 데이터에 기반한 탐색적 방법으로 쓰이며 군집원칙에 따라 여러 가지 방법이 제안되어 왔다. 또한 군집화된 결과에 대하여 유효성을 측정하는 측도도 다양한방법이 개발되었다. 본 연구에서는 계층적 군집분석 방법으로 최장연결법과 Ward의 방법, 비계층적 군집분석 방법으로 K-평균법 그리고 확률분포정보를 활용한 모형기반 군집분석방법을 이용하여 모의실험으로 군집분석을 실시하고 군집유효성 측도로는 연결성, Dunn 지수, 실루엣을 구하여 각 군집방법에 대해 유효성을 비교한다. 또한, 한우 관능평가 데이터에 군집분석을 적용하여 최적의 군집 상황을 구하고자 한다.

PC 클러스터 기반 병렬 유전 알고리즘-타부 탐색을 이용한 배전계통 고장 복구 (PC Cluster Based Parallel Genetic Algorithm-Tabu Search for Service Restoration of Distribution Systems)

  • 문경준;이화석;박준호;김형수
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제54권8호
    • /
    • pp.375-387
    • /
    • 2005
  • This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

PC Cluster based Parallel Adaptive Evolutionary Algorithm for Service Restoration of Distribution Systems

  • Mun, Kyeong-Jun;Lee, Hwa-Seok;Park, June-Ho;Kim, Hyung-Su;Hwang, Gi-Hyun
    • Journal of Electrical Engineering and Technology
    • /
    • 제1권4호
    • /
    • pp.435-447
    • /
    • 2006
  • This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of the GA and the local search capability of the ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC cluster system consisting of 8 PCs was developed. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based fast Ethernet. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.

기업 간 유대강도가 지식획득과 지식통합 및 혁신성과에 미치는 영향에 대한 연구: 산업단지 내 중소기업을 중심으로 (The Impact of Tie Strength on the Knowledge Acquisition, Knowledge Integration and Innovation Performance: Focusing on Small and Medium Sized Enterprises in the Industrial Clustering)

  • 심선영
    • 한국정보시스템학회지:정보시스템연구
    • /
    • 제28권2호
    • /
    • pp.53-72
    • /
    • 2019
  • Purpose The purpose of this study is to examine the impact of tie strength in the network of industrial clustering on the knowledge acquisition, integration and innovation performance of small and medium sized enterprises. We test the positive relationship of weak tie and knowledge acquisition, strong tie and knowledge integration, and the interaction effect of two tie strengths on both processes of knowledge acquisition and integration. By identifying these relationships, we can better understand how to manage the attributes of social networks in terms of tie strength in order to improve the performance of innovation for the small and medium sized enterprises. Design/methodology/approach We collect 200 survey data from 2 industrial cluster respectively: Pankyo and Guroo. In Pankyo, the proportion of IT industry is the highest (35%) while the proportion of manufacturing is highest (35%) in Guroo. Pooling the data from two industrial cluster, we check the reliability and validity of our research model and test the hypotheses. Findings First, we find the positive relationship of weak tie and knowledge acquisition from both industrial clustering. Weak tie is composed of heterogeneous organizations with various background and expertise. The communication and information sharing of organizations in the weak tie network helps the idea generation for organization's innovation, which is the knowledge acquisition process. Second, the relationship of strong tie and knowledge integration is insignificant. Typically the strong tie from long-lasting partnership is expected to be beneficial in the action stage of innovation, which is the knowledge integration process. However it is not identified in our industry cluster. Finally, the interaction effect of weak and strong tie is identified to be effective on both knowledge acquisition and integration processes.

온라인 농식품 구매시 소셜미디어 이용 군집에 따른 소비자특성에 대한 연구 (A Study on Consumer Characteristics According to Social Media Use Clusters When Purchasing Agri-food Online)

  • 이명관;박상혁;김연종
    • 벤처창업연구
    • /
    • 제16권4호
    • /
    • pp.195-209
    • /
    • 2021
  • 서울시 전자상거래센터에서 실시한 2019-2020년 소셜미디어 이용실태 조사에 따르면 소비자 10명 중 5명이 소셜미디어를 통한 쇼핑경험이 있는 것으로 조사되었으며, The CMO Survey에서 2020년 코로나 펜데믹 기간에 실시한 조사에 따르면 전통적인 광고매체의 비용은 축소되고 소셜미디어에 대한 광고지출은 74%나 상승함으로써 소셜미디어가 더욱 중요한 마케팅 요소로 자리하고 있음을 나타내고 있다. 이만큼 소셜미디어의 이용자 증가와 그에 따른 기업의 마케팅 활동이 활발해지는 동안 소셜미디어에 대한 사용자의 이용동기, 만족도, 구매의도 등 다양한 마케팅 측면에서 연구되어져 왔으나, 온라인을 통해 농식품을 구매하는 상황에서 소비자들의 소셜미디어 이용빈도가 실제 구매행위에 어떠한 차이로 나타나는가에 대해 세분화 한 연구는 없었다. 본 연구는 온라인에서 농식품을 구매하는 소비자들을 대상으로 소셜미디어 이용빈도에 따라 유형별로 군집화하여 농식품 구매상황에서 보여지는 군집별 소비자특성의 차이를 파악하고자 하였으며, 제품관여도, 제품필요도, 온라인 구매채널 선택 등 3가지 농식품 구매상황에 대해 각 군집에서 나타나는 인구통계학적 분포, 지각된 위험, 식습관 라이프스타일 등의 소비자 특성을 확인하고 군집별 유형을 제시하였다. 이를 위해 245명의 소비자를 대상으로 소셜미디어 이용빈도 및 온라인 농식품 구매행태에 대한 설문 자료를 수집하였으며, 요인분석과 신뢰성 분석으로 측정변수의 타당성을 확보하였다. 소셜미디어 이용빈도에 따른 군집분석을 실시한 결과 3개의 군집으로 나뉘어졌으며, 첫번째 군집은 주로 개방형 소셜미디어를 사용하는 집단, 두번째 군집은 개방형 소셜미디어와 폐쇄형 소셜미디어, 온라인 쇼핑몰을 고루 사용하는 집단, 세번째 군집은 전반적으로 온라인 매체 사용량이 적은 집단으로 군집별 특성이 나타났다. 각 3개의 군집을 통해 온라인에서 농식품 구매시 제품관여도, 제품필요도, 구매채널 선택에 미치는 영향을 회귀분석을 통해 확인하였다. 회귀분석 결과 온라인에서 농식품을 구매하는 상황에서 보여지는 군집1의 특성은 소셜미디어나 온라인쇼핑몰에서 농식품을 구매하는데 거부감이 없는 지방에 거주하는 30대 남자로 소비자특성이 대표된다. 군집2의 특성은 주로 건강식품 구매에 관심이 많은 소비자로 소비자특성이 대표된다. 군집3의 경우는 온라인에서 제품을 구매하는 경우 품질과 가격을 많이 따져보고 구매하며, 온라인보다 오프라인 구매가 더 안심인 사람으로 소비자특성이 대표된다. 본 연구를 통해 소셜미디어 이용빈도에 따라 농식품 구매상황에서 나타나는 소비자 특성의 차이를 확인함으로써 소셜미디어 고객타겟팅과 고객세분화 등에 대한 마케팅 실무의 전략적인 판단에 도움을 줄 수 있을 것으로 판단된다.

STL 파일 모델로부터 유한 요소망 자동 생성 (Generating FE Mesh Automatically from STL File Model)

  • 박정민;권기연;이병채;채수원
    • 대한기계학회논문집A
    • /
    • 제31권7호
    • /
    • pp.739-746
    • /
    • 2007
  • Recently, models in STL files are widely used in reverse engineering processes, CAD systems and analysis systems. However the models have poor geometric quality and include only triangles, so the models are not suitable for the finite element analysis. This paper presents a general method that generates finite element mesh from STL file models. Given triangular meshes, the method estimates triangles and makes clusters which consist of triangles. The clusters are merged by some geometric indices. After merging clusters, the method applies plane meshing algorithm, based on domain decomposition method, to each cluster and then the result plane mesh is projected into the original triangular set. Because the algorithm uses general methods to generate plane mesh, we can obtain both tri and quad meshes unlike previous researches. Some mechanical part models are used to show the validity of the proposed method.