• Title/Summary/Keyword: K-Mean++ Clustering

Search Result 283, Processing Time 0.023 seconds

Study on vertical variation of horizontal wind energy resources distribution using clustering analysis (군집분석을 통한 풍력자원 수평 공간 분포의 연직 변화에 관한 연구)

  • Kim, Min-Jung;Lee, Hwa-Woon;Lee, Soon-Hwan;Kim, Dong-Hyuk;Jung, Woo-Sik;Kim, Hyun-Goo
    • 한국신재생에너지학회:학술대회논문집
    • /
    • 2009.06a
    • /
    • pp.554-556
    • /
    • 2009
  • Wind classification for exact estimation of wind energy resources was carried out using numerically simulated wind data for three years. The MM5(a fifth-generation Mesoscale Model), developed at Penn State University and the National Center for Atmospheric Research (NCAR), was used to estimate the wind fields in this study. We also use a variant of the K-mean clustering to classify the wind district and define the relation between districts. Wind estimated at surface and 100 m high at Busan area is classified into the 10 and 7 classes, respectively. These discrepancies of wind districts pattern at surface and upper air meteorological data indicates the quantity of wind resources can be changed according to the level of wind data used in estimation. Therefore, the estimation of wind district classification by reasonable wind data is utilized to build the effective policy for wind energy dissemination.

  • PDF

A study on electricity demand forecasting based on time series clustering in smart grid (스마트 그리드에서의 시계열 군집분석을 통한 전력수요 예측 연구)

  • Sohn, Hueng-Goo;Jung, Sang-Wook;Kim, Sahm
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.1
    • /
    • pp.193-203
    • /
    • 2016
  • This paper forecasts electricity demand as a critical element of a demand management system in Smart Grid environment. We present a prediction method of using a combination of predictive values by time series clustering. Periodogram-based normalized clustering, predictive analysis clustering and dynamic time warping (DTW) clustering are proposed for time series clustering methods. Double Seasonal Holt-Winters (DSHW), Trigonometric, Box-Cox transform, ARMA errors, Trend and Seasonal components (TBATS), Fractional ARIMA (FARIMA) are used for demand forecasting based on clustering. Results show that the time series clustering method provides a better performances than the method using total amount of electricity demand in terms of the Mean Absolute Percentage Error (MAPE).

Automatic Classification Algorithm for Raw Materials using Mean Shift Clustering and Stepwise Region Merging in Color (컬러 영상에서 평균 이동 클러스터링과 단계별 영역 병합을 이용한 자동 원료 분류 알고리즘)

  • Kim, SangJun;Kwak, JoonYoung;Ko, ByoungChul
    • Journal of Broadcast Engineering
    • /
    • v.21 no.3
    • /
    • pp.425-435
    • /
    • 2016
  • In this paper, we propose a classification model by analyzing raw material images recorded using a color CCD camera to automatically classify good and defective agricultural products such as rice, coffee, and green tea, and raw materials. The current classifying agricultural products mainly depends on visual selection by skilled laborers. However, classification ability may drop owing to repeated labor for a long period of time. To resolve the problems of existing human dependant commercial products, we propose a vision based automatic raw material classification combining mean shift clustering and stepwise region merging algorithm. In this paper, the image is divided into N cluster regions by applying the mean-shift clustering algorithm to the foreground map image. Second, the representative regions among the N cluster regions are selected and stepwise region-merging method is applied to integrate similar cluster regions by comparing both color and positional proximity to neighboring regions. The merged raw material objects thereby are expressed in a 2D color distribution of RG, GB, and BR. Third, a threshold is used to detect good and defective products based on color distribution ellipse for merged material objects. From the results of carrying out an experiment with diverse raw material images using the proposed method, less artificial manipulation by the user is required compared to existing clustering and commercial methods, and classification accuracy on raw materials is improved.

Optimizing Clustering and Predictive Modelling for 3-D Road Network Analysis Using Explainable AI

  • Rotsnarani Sethy;Soumya Ranjan Mahanta;Mrutyunjaya Panda
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.9
    • /
    • pp.30-40
    • /
    • 2024
  • Building an accurate 3-D spatial road network model has become an active area of research now-a-days that profess to be a new paradigm in developing Smart roads and intelligent transportation system (ITS) which will help the public and private road impresario for better road mobility and eco-routing so that better road traffic, less carbon emission and road safety may be ensured. Dealing with such a large scale 3-D road network data poses challenges in getting accurate elevation information of a road network to better estimate the CO2 emission and accurate routing for the vehicles in Internet of Vehicle (IoV) scenario. Clustering and regression techniques are found suitable in discovering the missing elevation information in 3-D spatial road network dataset for some points in the road network which is envisaged of helping the public a better eco-routing experience. Further, recently Explainable Artificial Intelligence (xAI) draws attention of the researchers to better interprete, transparent and comprehensible, thus enabling to design efficient choice based models choices depending upon users requirements. The 3-D road network dataset, comprising of spatial attributes (longitude, latitude, altitude) of North Jutland, Denmark, collected from publicly available UCI repositories is preprocessed through feature engineering and scaling to ensure optimal accuracy for clustering and regression tasks. K-Means clustering and regression using Support Vector Machine (SVM) with radial basis function (RBF) kernel are employed for 3-D road network analysis. Silhouette scores and number of clusters are chosen for measuring cluster quality whereas error metric such as MAE ( Mean Absolute Error) and RMSE (Root Mean Square Error) are considered for evaluating the regression method. To have better interpretability of the Clustering and regression models, SHAP (Shapley Additive Explanations), a powerful xAI technique is employed in this research. From extensive experiments , it is observed that SHAP analysis validated the importance of latitude and altitude in predicting longitude, particularly in the four-cluster setup, providing critical insights into model behavior and feature contributions SHAP analysis validated the importance of latitude and altitude in predicting longitude, particularly in the four-cluster setup, providing critical insights into model behavior and feature contributions with an accuracy of 97.22% and strong performance metrics across all classes having MAE of 0.0346, and MSE of 0.0018. On the other hand, the ten-cluster setup, while faster in SHAP analysis, presented challenges in interpretability due to increased clustering complexity. Hence, K-Means clustering with K=4 and SVM hybrid models demonstrated superior performance and interpretability, highlighting the importance of careful cluster selection to balance model complexity and predictive accuracy.

Classification of Traffic Flows into QoS Classes by Unsupervised Learning and KNN Clustering

  • Zeng, Yi;Chen, Thomas M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.2
    • /
    • pp.134-146
    • /
    • 2009
  • Traffic classification seeks to assign packet flows to an appropriate quality of service(QoS) class based on flow statistics without the need to examine packet payloads. Classification proceeds in two steps. Classification rules are first built by analyzing traffic traces, and then the classification rules are evaluated using test data. In this paper, we use self-organizing map and K-means clustering as unsupervised machine learning methods to identify the inherent classes in traffic traces. Three clusters were discovered, corresponding to transactional, bulk data transfer, and interactive applications. The K-nearest neighbor classifier was found to be highly accurate for the traffic data and significantly better compared to a minimum mean distance classifier.

Adaptive Clustering Algorithm for Recycling Cell Formation: An Application of Fuzzy ART Neural Networks

  • Seo, Kwang-Kyu;Park, Ji-Hyung
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.12
    • /
    • pp.2137-2147
    • /
    • 2004
  • The recycling cell formation problem means that disposal products are classified into recycling part families using group technology in their end-of-life phase. Disposal products have the uncertainties of product status by usage influences during product use phase, and recycling cells are formed design, process and usage attributes. In order to deal with the uncertainties, fuzzy set theory and fuzzy logic-based neural network model are applied to recycling cell formation problem for disposal products. Fuzzy C-mean algorithm and a heuristic approach based on fuzzy ART neural network is suggested. Especially, the modified Fuzzy ART neural network is shown that it has a good clustering results and gives an extension for systematically generating alternative solutions in the recycling cell formation problem. Disposal refrigerators are shown as examples.

Realtime Object Region Detection Robust to Vehicle Headlight (차량의 헤드라이트에 강인한 실시간 객체 영역 검출)

  • Yeon, Sungho;Kim, Jaemin
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.2
    • /
    • pp.138-148
    • /
    • 2015
  • Object detection methods based on background learning are widely used in video surveillance. However, when a car runs with headlights on, these methods are likely to detect the car region and the area illuminated by the headlights as one connected change region. This paper describes a method of separating the car region from the area illuminated by the headlights. First, we detect change regions with a background learning method, and extract blobs, connected components in the detected change region. If a blob is larger than the maximum object size, we extract candidate object regions from the blob by clustering the intensity histogram of the frame difference between the mean of background images and an input image. Finally, we compute the similarity between the mean of background images and the input image within each candidate region and select a candidate region with weak similarity as an object region.

An Automatic Object Extraction Method Using Color Features Of Object And Background In Image (영상에서 객체와 배경의 색상 특징을 이용한 자동 객체 추출 기법)

  • Lee, Sung Kap;Park, Young Soo;Lee, Gang Seong;Lee, Jong Yong;Lee, Sang Hun
    • Journal of Digital Convergence
    • /
    • v.11 no.12
    • /
    • pp.459-465
    • /
    • 2013
  • This paper is a study on an object extraction method which using color features of an object and background in the image. A human recognizes an object through the color difference of object and background in the image. So we must to emphasize the color's difference that apply to extraction result in this image. Therefore, we have converted to HSV color images which similar to human visual system from original RGB images, and have created two each other images that applied Median Filter and we merged two Median filtered images. And we have applied the Mean Shift algorithm which a data clustering method for clustering color features. Finally, we have normalized 3 image channels to 1 image channel for binarization process. And we have created object map through the binarization which using average value of whole pixels as a threshold. Then, have extracted major object from original image use that object map.

Classification of Wind Sector in Pohang Region Using Similarity of Time-Series Wind Vectors (시계열 풍속벡터의 유사성을 이용한 포항지역 바람권역 분류)

  • Kim, Hyun-Goo;Kim, Jinsol;Kang, Yong-Heack;Park, Hyeong-Dong
    • Journal of the Korean Solar Energy Society
    • /
    • v.36 no.1
    • /
    • pp.11-18
    • /
    • 2016
  • The local wind systems in the Pohang region were categorized into wind sectors. Still, thorough knowledge of wind resource assessment, wind environment analysis, and atmospheric environmental impact assessment was required since the region has outstanding wind resources, it is located on the path of typhoon, and it has large-scale atmospheric pollution sources. To overcome the resolution limitation of meteorological dataset and problems of categorization criteria of the preceding studies, the high-resolution wind resource map of the Korea Institute of Energy Research was used as time-series meteorological data; the 2-step method of determining the clustering coefficient through hierarchical clustering analysis and subsequently categorizing the wind sectors through non-hierarchical K-means clustering analysis was adopted. The similarity of normalized time-series wind vector was proposed as the Euclidean distance. The meteor-statistical characteristics of the mean vector wind distribution and meteorological variables of each wind sector were compared. The comparison confirmed significant differences among wind sectors according to the terrain elevation, mean wind speed, Weibull shape parameter, etc.

3D Printing Watermarking Method Based on Radius Curvature of 3D Triangle

  • Pham, Ngoc-Giao;Song, Ha-Joo;Lee, Suk-Hwan;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.12
    • /
    • pp.1951-1959
    • /
    • 2017
  • Due to the fact that 3D printing is applied to many areas of life, 3D printing models are often used illegally without any permission from the original providers. This paper presents a novel watermarking algorithm for the copyright protection and ownership identification for 3D printing based on the radius curvature of 3D triangle. 3D triangles are extracted and classified into groups based on radius curvature by the clustering algorithm, and then the mean radius curvature of each group will be computed for watermark embedding. The watermark data is embedded to the groups of 3D triangle by changing the mean radius curvature of each group. In each group, we select a 3D triangle which has the nearest radius curvature with the changed mean radius curvature. Finally, we change the vertices of the selected facet according to the changed radius curvature has been embedded watermark. In experiments, the distance error between the original 3D printing model and the watermarked 3D printing model is approximate zero, and the Bit Error Rate is also very low. From experimental results, we verify that the proposed algorithm is invisible and robustness with geometric attacks rotation, scaling and translation.