• Title/Summary/Keyword: Time-based Clustering

Search Result 721, Processing Time 0.031 seconds

A Study on Technology Forecasting based on Co-occurrence Network of Keyword in Multidisciplinary Journals (다학제 분야 학술지의 주제어 동시발생 네트워크를 활용한 기술예측 연구)

  • Kim, Hyunuk;Ahn, Sang-Jin;Jung, Woo-Sung
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.40 no.4
    • /
    • pp.49-63
    • /
    • 2015
  • Keyword indexed in multidisciplinary journals show trends about science and technology innovation. Nature and Science were selected as multidisciplinary journals for our analysis. In order to reduce the effect of plurality of keyword, stemming algorithm were implemented. After this process, we fitted growth curve of keyword (stem) following bass model, which is a well-known model in diffusion process. Bass model is useful for expressing growth pattern by assuming innovative and imitative activities in innovation spreading. In addition, we construct keyword co-occurrence network and calculate network measures such as centrality indices and local clustering coefficient. Based on network metrics and yearly frequency of keyword, time series analysis was conducted for obtaining statistical causality between these measures. For some cases, local clustering coefficient seems to Granger-cause yearly frequency of keyword. We expect that local clustering coefficient could be a supportive indicator of emerging science and technology.

Time series clustering for AMI data in household smart grid (스마트그리드 환경하의 가정용 AMI 자료를 위한 시계열 군집분석 연구)

  • Lee, Jin-Young;Kim, Sahm
    • The Korean Journal of Applied Statistics
    • /
    • v.33 no.6
    • /
    • pp.791-804
    • /
    • 2020
  • Residential electricity consumption can be predicted more accurately by utilizing the realtime household electricity consumption reference that can be collected by the AMI as the ICT developed under the smart grid circumstance. This paper studied the model that predicts residential power load using the ARIMA, TBATS, NNAR model based on the data of hour unit amount of household electricity consumption, and unlike forecasting the consumption of the whole households at once, it computed the anticipated amount of the electricity consumption by aggregating the predictive value of each established model of cluster that was collected by the households which show the similiar load profile. Especially, as the typical time series data, the electricity consumption data chose the clustering analysis method that is appropriate to the time series data. Therefore, Dynamic Time Warping and Periodogram based method is used in this paper. By the result, forecasting the residential elecrtricity consumption by clustering the similiar household showed better performance than forecasting at once and in summertime, NNAR model performed best, and in wintertime, it was TBATS model. Lastly, clustering method showed most improvements in forecasting capability when the DTW method that was manifested the difference between the patterns of each cluster was used.

Noise Averaging Effect on Privacy-Preserving Clustering of Time-Series Data (시계열 데이터의 프라이버시 보호 클러스터링에서 노이즈 평준화 효과)

  • Moon, Yang-Sae;Kim, Hea-Suk
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.3
    • /
    • pp.356-360
    • /
    • 2010
  • Recently, there have been many research efforts on privacy-preserving data mining. In privacy-preserving data mining, accuracy preservation of mining results is as important as privacy preservation. Random perturbation privacy-preserving data mining technique is known to well preserve privacy. However, it has a problem that it destroys distance orders among time-series. In this paper, we propose a notion of the noise averaging effect of piecewise aggregate approximation(PAA), which can be preserved the clustering accuracy as high as possible in time-series data clustering. Based on the noise averaging effect, we define the PAA distance in computing distance. And, we show that our PAA distance can alleviate the problem of destroying distance orders in random perturbing time series.

Image Recognition and Clustering for Virtual Reality based on Cognitive Rehabilitation Contents (가상현실 기반 인지재활 콘텐츠를 위한 영상 인식 및 군집화)

  • Choi, KwonTaeg
    • Journal of Digital Contents Society
    • /
    • v.18 no.7
    • /
    • pp.1249-1257
    • /
    • 2017
  • Due to the 4th industrial revolution and an aged society, many studies are being conducted to apply virtual reality to medical field. Research on dementia is especially active. This paper proposes virtual reality based on cognitive rehabilitation contents using image recognition and clustering method to improve cognitive and physical disabilities caused by dementia. Unlike the existing cognitive rehabilitation system, this paper uses travel photos that reflect the memories of the subjects to be treated. In order to generate automated cognitive rehabilitation contents, we extract face information, food pictures, place information, and time information from photographs, and normalization is performed for clustering. And we present scenarios that can be used as cognitive rehabilitation contents using travel photos in virtual reality space.

An efficient Video Dehazing Algorithm Based on Spectral Clustering

  • Zhao, Fan;Yao, Zao;Song, Xiaofang;Yao, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.3239-3267
    • /
    • 2018
  • Image and video dehazing is a popular topic in the field of computer vision and digital image processing. A fast, optimized dehazing algorithm was recently proposed that enhances contrast and reduces flickering artifacts in a dehazed video sequence by minimizing a cost function that makes transmission values spatially and temporally coherent. However, its fixed-size block partitioning leads to block effects. The temporal cost function also suffers from the temporal non-coherence of newly appearing objects in a scene. Further, the weak edges in a hazy image are not addressed. Hence, a video dehazing algorithm based on well designed spectral clustering is proposed. To avoid block artifacts, the spectral clustering is customized to segment static scenes to ensure the same target has the same transmission value. Assuming that edge images dehazed with optimized transmission values have richer detail than before restoration, an edge intensity function is added to the spatial consistency cost model. Atmospheric light is estimated using a modified quadtree search. Different temporal transmission models are established for newly appearing objects, static backgrounds, and moving objects. The experimental results demonstrate that the new method provides higher dehazing quality and lower time complexity than the previous technique.

Corrosion Image Monitoring of steel plate by using k-means clustering (k-means 클러스터링을 이용한 강판의 부식 이미지 모니터링)

  • Kim, Beomsoo;Kwon, Jaesung;Choi, Sungwoong;Noh, Jungpil;Lee, Kyunghwang;Yang, Jeonghyeon
    • Journal of the Korean institute of surface engineering
    • /
    • v.54 no.5
    • /
    • pp.278-284
    • /
    • 2021
  • Corrosion of steel plate is common phenomenon which results in the gradual destruction caused by a wide variety of environments. Corrosion monitoring is the tracking of the degradation progress for a long period of time. Corrosion on steel plate appears as a discoloration and any irregularities on the surface. In this study, we developed a quantitative evaluation method of the rust formed on steel plate by using k-means clustering from the corroded area in a given image. The k-means clustering for automated corrosion detection was based on the GrabCut segmentation and Gaussian mixture model(GMM). Image color of the corroded surface at cut-edge area was analyzed quantitatively based on HSV(Hue, Saturation, Value) color space.

An Energy Efficient Clustering Algorithm in Mobile Adhoc Network Using Ticket Id Based Clustering Manager

  • Venkatasubramanian, S.;Suhasini, A.;Vennila, C.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.7
    • /
    • pp.341-349
    • /
    • 2021
  • Many emerging mobile ad-hoc network application communications are group-oriented. Multicast supports group-oriented applications efficiently, particularly in a mobile environment that has a limited bandwidth and limited power. Energy effectiveness along with safety are 2 key problem in MANET design. Within this paper, MANET is presented with a stable, energy-efficient clustering technique. In this proposed work advanced clustering in the networks with ticket ID cluster manager (TID-CMGR) has formed in MANET. The proposed routing scheme makes secure networking the shortest route possible. In this article, we propose a Cluster manager approach based on TICKET-ID to address energy consumption issues and reduce CH workload. TID-CMGR includes two mechanism including ticket ID controller, ticketing pool, route planning and other components. The CA (cluster agent) shall control and supervise the functions of nodes and inform to TID-CMGR. The CH conducts and transfers packets to the network nodes. As the CH energy level is depleted, CA elects the corresponding node with elevated energy values, and all new and old operations are simultaneously stored by CA at this time. A simulation trial for 20 to 100 nodes was performed to show the proposed scheme performance. The suggested approach is used to do experimental work using the NS- simulator. TIDCMGR is compared with TID BRM and PSO to calculate the utility of the work proposed. The assessment shows that the proposed TICKET-ID scheme achieves 90 percent more than other current systems.

Optimization study of a clustering algorithm for cosmic-ray muon scattering tomography used in fast inspection

  • Hou, Linjun;Huo, Yonggang;Zuo, Wenming;Yao, Qingxu;Yang, Jianqing;Zhang, Quanhu
    • Nuclear Engineering and Technology
    • /
    • v.53 no.1
    • /
    • pp.208-215
    • /
    • 2021
  • Cosmic-ray muon scattering tomography (MST) technology is a new radiation imaging technology with unique advantages. As the performance of its image reconstruction algorithm has a crucial influence on the imaging quality, researches on this algorithm are of great significance to the development and application of this technology. In this paper, a fast inspection algorithm based on clustering analysis for the identification of the existence of nuclear materials is studied and optimized. Firstly, the principles of MST technology and a binned clustering algorithm were introduced, and then several simulation experiments were carried out using Geant4 toolkit to test the effects of exposure time, algorithm parameter, the size and structure of object on the performance of the algorithm. Based on these, we proposed two optimization methods for the clustering algorithm: the optimization of vertical distance coefficient and the displacement of sub-volumes. Finally, several sets of experiments were designed to validate the optimization effect, and the results showed that these two optimization methods could significantly enhance the distinguishing ability of the algorithm for different materials, help to obtain more details in practical applications, and was therefore of great importance to the development and application of the MST technology.

Design of HCBKA-Based IT2TSK Fuzzy Prediction System (HCBKA 기반 IT2TSK 퍼지 예측시스템 설계)

  • Bang, Young-Keun;Lee, Chul-Heui
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.7
    • /
    • pp.1396-1403
    • /
    • 2011
  • It is not easy to analyze the strong nonlinear time series and effectively design a good prediction system especially due to the difficulties in handling the potential uncertainty included in data and prediction method. To solve this problem, a new design method for fuzzy prediction system is suggested in this paper. The proposed method contains the followings as major parts ; the first-order difference detection to extract the stable information from the nonlinear characteristics of time series, the fuzzy rule generation based on the hierarchically classifying clustering technique to reduce incorrectness of the system parameter identification, and the IT2TSK fuzzy logic system to reasonably handle the potential uncertainty of the series. In addition, the design of the multiple predictors is considered to reflect sufficiently the diverse characteristics concealed in the series. Finally, computer simulations are performed to verify the performance and the effectiveness of the proposed prediction system.

Fast Outlier Removal for Image Registration based on Modified K-means Clustering

  • Soh, Young-Sung;Qadir, Mudasar;Kim, In-Taek
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.16 no.1
    • /
    • pp.9-14
    • /
    • 2015
  • Outlier detection and removal is a crucial step needed for various image processing applications such as image registration. Random Sample Consensus (RANSAC) is known to be the best algorithm so far for the outlier detection and removal. However RANSAC requires a cosiderable computation time. To drastically reduce the computation time while preserving the comparable quality, a outlier detection and removal method based on modified K-means is proposed. The original K-means was conducted first for matching point pairs and then cluster merging and member exclusion step are performed in the modification step. We applied the methods to various images with highly repetitive patterns under several geometric distortions and obtained successful results. We compared the proposed method with RANSAC and showed that the proposed method runs 3~10 times faster than RANSAC.