• Title/Summary/Keyword: Spatial Clustering

Search Result 354, Processing Time 0.023 seconds

Machine Learning-based Screening Algorithm for Energy Storage System Using Retired Lithium-ion Batteries (에너지 저장 시스템 적용을 위한 머신러닝 기반의 폐배터리 스크리닝 알고리즘)

  • Han, Eui-Seong;Lim, Je-Yeong;Lee, Hyeon-Ho;Kim, Dong-Hwan;Noh, Tae-Won;Lee, Byoung-Kuk
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.27 no.3
    • /
    • pp.265-274
    • /
    • 2022
  • This paper proposes a machine learning-based screening algorithm to build the retired battery pack of the energy storage system. The proposed algorithm creates the dataset of various performance parameters of the retired battery, and this dataset is preprocessed through a principal component analysis to reduce the overfitting problem. The retried batteries with a large deviation are excluded in the dataset through a density-based spatial clustering of applications with noise, and the K-means clustering method is formulated to select the group of the retired batteries to satisfy the deviation requirement conditions. The performance of the proposed algorithm is verified based on NASA and Oxford datasets.

County Level Clustering on Alcohol and HIV Mortality

  • Park, Byeonghwa
    • Communications for Statistical Applications and Methods
    • /
    • v.20 no.1
    • /
    • pp.53-62
    • /
    • 2013
  • This study focuses on spatial/temporal relationship deaths caused by Human Immunodeficiency Virus (HIV) and Alcohol Use Disorder (AUD). Several studies have found links between these two diseases. By looking for clusters in mortality of Alcohol and HIV related deaths this study contributes to the field through the identification of exact spatial/temporal time of high and low occurrence risks based on the observed over the expected number of deaths. This study does not provide political or social interpretations of the data. It merely wants to show where clusters are found.

Application of Spatial Autocorrelation for the Spatial Distribution Pattern Analysis of Marine Environment - Case of Gwangyang Bay - (해양환경 공간분포 패턴 분석을 위한 공간자기상관 적용 연구 - 광양만을 사례 지역으로 -)

  • Choi, Hyun-Woo;Kim, Kye-Hyun;Lee, Chul-Yong
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.10 no.4
    • /
    • pp.60-74
    • /
    • 2007
  • For quantitative analysis of spatio-temporal distribution pattern on marine environment, spatial autocorrelation statistics on the both global and local aspects was applied to the observed data obtained from Gwangyang Bay in South Sea of Korea. Global indexes such as Moran's I and General G were used for understanding environmental distribution pattern in the whole study area. LISAs (local indicators of spatial association) such as Moran's I ($I_i$) and $G_i{^*}$ were considered to find similarity between a target feature and its neighborhood features and to detect hot spot and/or cold spot. Additionally, the significance test on clustered patterns by Z-scores was carried out. Statistical results showed variations of spatial patterns quantitatively in the whole year. Then all of general water quality, nutrients, chlorophyll-a and phytoplankton had strong clustered pattern in summer. When global indexes showed strong clustered pattern, the front region with a negative $I_i$ which means a strong spatial variation was observed. Also, when global indexes showed random pattern, hot spot and/or cold spot were/was found in the small local region with a local index $G_i{^*}$. Therefore, global indexes were useful for observing the strength and time series variations of clustered patterns in the whole study area, and local indexes were useful for tracing the location of hot spot and/or cold spot. Quantification of both spatial distribution pattern and clustering characteristics may play an important role to understand marine environment in depth and to find the reasons for spatial pattern.

  • PDF

Hierarchical Clustering Analysis of Water Main Leak Location Data (상수관로 누수위치 자료를 이용한 계층적 군집분석)

  • Park, Su-Wan;Im, Gwang-Chae;Choi, Chang-Lok;Kim, Kyu-Lee
    • Journal of Korea Water Resources Association
    • /
    • v.42 no.3
    • /
    • pp.177-190
    • /
    • 2009
  • Rehabilitation projects for old water mains typically require considerable capital investments. One of the economical ways of pursuing the rehabilitation projects is to focus on a specific area within the entire region under management. In this paper the hierarchical clustering methods that analyze spatial inter-relationship of location data are applied to about 8,000 water leak location data recorded in a case study area from 1992 to 1997. Among the hierarchical clustering methods Single, Complete, and Average Linkage Methods are used to identify clusters of the water leak locations and to divide the area according to the defined clusters. By comparing the clusters identified by the clustering methods, the best clustering method for the case study area is suggested. Prioritization of the area for maintenance is obtained based on the water leak incident intensity for the clustered area using the suggested best clustering method.

Top-down Hierarchical Clustering using Multidimensional Indexes (다차원 색인을 이용한 하향식 계층 클러스터링)

  • Hwang, Jae-Jun;Mun, Yang-Se;Hwang, Gyu-Yeong
    • Journal of KIISE:Databases
    • /
    • v.29 no.5
    • /
    • pp.367-380
    • /
    • 2002
  • Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26~187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

A Conditional Clustering Scheme for Hybrid NOMA in Millimeter Wave Communication System

  • Nguyen, Thanh Ngoc;Jeon, Taehyun
    • International journal of advanced smart convergence
    • /
    • v.8 no.4
    • /
    • pp.34-39
    • /
    • 2019
  • Millimeter-wave (mmWave) and Non-orthogonal multiple access (NOMA) are expected to be the major techniques that lead to the next generation wireless communication. NOMA provides a high spectrum efficiency by sharing of spatial resources among users in the same frequency band. Meanwhile, millimeter-wave gives a huge underutilized bandwidth at extremely high frequency band (EHF) which covers 30GHz to 300GHz. These techniques have been proven in several recent literatures to achieve high data rates. The combination of NOMA and millimeter-wave techniques further improves average sum capacities, as well as reduces the interference compared to conventional wireless communication systems. In this paper, we focus on hybrid NOMA system working in millimeter-wave frequency. We propose a clustering algorithm used for a hybrid NOMA scheme to optimize the usage of wireless resources. The proposed clustering algorithm adds several conditions in grouping users and defining clusters to increase the probability of the successful superposition decoding process. The performance of the proposed clustering algorithm is investigated in hybrid NOMA system and compared with the conventional orthogonal multiple access (OMA) scheme.

An Optimization Method for the Calculation of SCADA Main Grid's Theoretical Line Loss Based on DBSCAN

  • Cao, Hongyi;Ren, Qiaomu;Zou, Xiuguo;Zhang, Shuaitang;Qian, Yan
    • Journal of Information Processing Systems
    • /
    • v.15 no.5
    • /
    • pp.1156-1170
    • /
    • 2019
  • In recent years, the problem of data drifted of the smart grid due to manual operation has been widely studied by researchers in the related domain areas. It has become an important research topic to effectively and reliably find the reasonable data needed in the Supervisory Control and Data Acquisition (SCADA) system has become an important research topic. This paper analyzes the data composition of the smart grid, and explains the power model in two smart grid applications, followed by an analysis on the application of each parameter in density-based spatial clustering of applications with noise (DBSCAN) algorithm. Then a comparison is carried out for the processing effects of the boxplot method, probability weight analysis method and DBSCAN clustering algorithm on the big data driven power grid. According to the comparison results, the performance of the DBSCAN algorithm outperforming other methods in processing effect. The experimental verification shows that the DBSCAN clustering algorithm can effectively screen the power grid data, thereby significantly improving the accuracy and reliability of the calculation result of the main grid's theoretical line loss.

Project-based Organization, Embeddedness and Spatial Clustering in the TV Drama Industry (프로젝트 기반 조직의 배태성과 공간적 군집화에 대한 시론적 연구 -드라마 산업을 사례로-)

  • Hwang, Eun-Jung;Lee, Hee-Yeon
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.11 no.3
    • /
    • pp.442-458
    • /
    • 2008
  • This paper aims to examine the ways in which project-based organizations (PBOs) are embedded in social networks and geographical clustering in the case of TV drama industry. PBOs refer to a variety of temporary organizational forms for the performance of tasks as to integrate diverse and specialized intellectual resources. PEOs as a flexible and innovative mode of organizing knowledge resources are becoming increasingly worthy of attention in emerging the creative economy. Evidence from interviews with core persons of PEOs like producers, directors, and writers reveals that the key operational mechanism of the project form of organization is based on the highly socialized networks via individual's reputation and past experiences. In other words, the project activity in TV drama is embedded in networks which are socially constructed. Also the geographical clustering plays an important role in PBOs and project practices in TV drama are constructed around a high degree of spatial clustering. PBOs are clustering in Kang-nam and Yeouido, where are located in independent production companies and broadcasting stations. It means that the project formation in TV drama requires geographically-clustered networks of human resources, and socially, culturally and geographically embedded latent networks of interpersonal relationships are a necessary condition of POBs in the TV drama industry.

  • PDF

A Spatio-Temporal Clustering Technique for the Moving Object Path Search (이동 객체 경로 탐색을 위한 시공간 클러스터링 기법)

  • Lee, Ki-Young;Kang, Hong-Koo;Yun, Jae-Kwan;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.7 no.3 s.15
    • /
    • pp.67-81
    • /
    • 2005
  • Recently, the interest and research on the development of new application services such as the Location Based Service and Telemetics providing the emergency service, neighbor information search, and route search according to the development of the Geographic Information System have been increasing. User's search in the spatio-temporal database which is used in the field of Location Based Service or Telemetics usually fixes the current time on the time axis and queries the spatial and aspatial attributes. Thus, if the range of query on the time axis is extensive, it is difficult to efficiently deal with the search operation. For solving this problem, the snapshot, a method to summarize the location data of moving objects, was introduced. However, if the range to store data is wide, more space for storing data is required. And, the snapshot is created even for unnecessary space that is not frequently used for search. Thus, non storage space and memory are generally used in the snapshot method. Therefore, in this paper, we suggests the Hash-based Spatio-Temporal Clustering Algorithm(H-STCA) that extends the two-dimensional spatial hash algorithm used for the spatial clustering in the past to the three-dimensional spatial hash algorithm for overcoming the disadvantages of the snapshot method. And, this paper also suggests the knowledge extraction algorithm to extract the knowledge for the path search of moving objects from the past location data based on the suggested H-STCA algorithm. Moreover, as the results of the performance evaluation, the snapshot clustering method using H-STCA, in the search time, storage structure construction time, optimal path search time, related to the huge amount of moving object data demonstrated the higher performance than the spatio-temporal index methods and the original snapshot method. Especially, for the snapshot clustering method using H-STCA, the more the number of moving objects was increased, the more the performance was improved, as compared to the existing spatio-temporal index methods and the original snapshot method.

  • PDF

Design and Implementation of Load Balancing Method for Efficient Spatial Query Processing in Clustering Environment (클러스터링 환경에서 효율적인 공간 질의 처리를 위한 로드 밸런싱 기법의 설계 및 구현)

  • 김종훈;이찬구;정현민;정미영;배영호
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.3
    • /
    • pp.384-396
    • /
    • 2003
  • Hybrid query processing method is used for preventing server overload that is created by heavy user connection in Web GIS. In Hybrid query processing method, both server and client participate in spatial query processing. But, Hybrid query processing method is restricted in scalability of server and it can't be fundamentally solution for server overload. So, it is necessary for Web GIS to be brought in web clustering technique. In this thesis, we propose load-balancing method that uses proximity of query region. In this paper, we create tile groups that have relation each tile in same group is very close, and forward client request to the server that can have maximum rate of buffer reuse with considering characteristic of spatial query. With out load balancing method, buffet in server is optimized for exploring spatial index tree and increase rate of buffer reuse, so it can be reduced amount of disk access and increase system performance.

  • PDF