• Journal of Electrical Engineering and Technology
• /
• 제11권6호
• /
• pp.1527-1534
• /
• 2016

Online voltage stability monitoring using real-time measurements is one of the most important tasks in a smart grid system to maintain the grid stability. Loading margin is a good indicator for assessing the voltage stability level. This paper presents an Extreme Learning Machine (ELM) approach for estimation of voltage stability level under credible contingencies using real-time measurements from Phasor Measurement Units (PMUs). PMUs enable a much higher data sampling rate and provide synchronized measurements of real-time phasors of voltages and currents. Depth First (DF) algorithm is used for optimally placing the PMUs. To make the ELM approach applicable for a large scale power system problem, Mutual information (MI)-based feature selection is proposed to achieve the dimensionality reduction. MI-based feature selection reduces the number of network input features which reduces the network training time and improves the generalization capability. Voltage magnitudes and phase angles received from PMUs are fed as inputs to the ELM model. IEEE 30-bus test system is considered for demonstrating the effectiveness of the proposed methodology for estimating the voltage stability level under various loading conditions considering single line contingencies. Simulation results validate the suitability of the technique for fast and accurate online voltage stability assessment using PMU data.

• 경영과학
• /
• 제17권3호
• /
• pp.19-30
• /
• 2000

Customization and personalization services are considered as a critical success factor to be a successful Internet store or web service provider. As a representative personalization technique, personalized recommendation techniques are studied and commercialized to suggest products or services to a customer of Internet storefronts based on demographics of the customer or based on an analysis of the past purchasing behavior of the customer. The underlining theories of recommendation techniques are statistics, data mining, artificial intelligence, and/or rule-based matching. In the rule-based approach for personalized recommendation, marketing rules for personalization are usually collected from marketing experts and are used to inference with customers data. however, it is difficult to extract marketing rules from marketing experts, and also difficult to validate and to maintain the constructed knowledge base. In this paper, we proposed a marketing rule extraction technique for personalized recommendation on Internet storefronts using market basket analysis technique, a well-known data mining technique. Using marketing basket analysis technique, marketing rules for cross sales are extracted, and are used to provide personalized advertisement selection when a customer visits in an Internet store. An experiment has been performed to evaluate the effectiveness of proposed approach comparing with preference scoring approach and random selection.

• Journal of Computing Science and Engineering
• /
• 제10권4호
• /
• pp.111-117
• /
• 2016

An accurate approach for diagnosis of attention deficit hyperactivity disorder (ADHD) is presented in this paper. The presented technique efficiently classifies three subtypes of ADHD (ADHD-C, ADHD-H, ADHD-I) and typically developing control (TDC) by using only structural magnetic resonance imaging (MRI). The research examines structural MRI of the hippocampus from the ADHD-200 database. Each available MRI has been processed by a region-of-interest (ROI) to build a set of features for further analysis. The presented ADHD diagnostic approach unifies feature selection and classification techniques. The feature selection technique based on the proposed binary-coded genetic algorithm searches for an optimal subset of features extracted from the hippocampus. The classification technique uses a chosen optimal subset of features for accurate classification of three subtypes of ADHD and TDC. In this study, the famous Extreme Learning Machine is used as a classification technique. Experimental results clearly indicate that the presented BCGA-ELM (binary-coded genetic algorithm coupled with Extreme Learning Machine) efficiently classifies TDC and three subtypes of ADHD and outperforms existing techniques.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume I
• /
• pp.297-300
• /
• 2006

The knowledge of fuel load and composition is important for planning and managing the fire hazard and risk. However, fuel mapping is extremely difficult because fuel properties vary at spatial scales, change depending on the seasonal situations and are affected by the surrounding environment. Remote sensing has potential of reduction the uncertainty in mapping fuels and offers the best approach for improving our abilities. This paper compared the results of object-oriented classification to a pixel-based classification for fuel type map derived from Hyperion hyperspectral data that could be enable to provide this information and allow a differentiation of material due to their typical spectra. Our methodological approach for fuel type map is characterized by the result of the spectral mixture analysis (SMA) that can used to model the spectral variability in multi- or hyperspectral images and to relate the results to the physical abundance of surface constitutes represented by the spectral endmembers. Object-oriented approach was based on segment based endmember selection, while pixel-based method used standard SMA. To validate and compare, we used true-color high resolution orthoimagery

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2005년도 춘계 학술발표회 논문집
• /
• pp.17-23
• /
• 2005

In this paper we consider the well-known semiparametric proportional hazards models for survival analysis. These models are usually used with few covariates and many observations (subjects). But, for a typical setting of gene expression data from DNA microarray, we need to consider the case where the number of covariates p exceeds the number of samples n. For a given vector of response values which are times to event (death or censored times) and p gene expressions(covariates), we address the issue of how to reduce the dimension by selecting the significant genes. This approach enables us to estimate the survival curve when n ${\ll}$p. In our approach, rather than fixing the number of selected genes, we will assign a prior distribution to this number. The approach creates additional flexibility by allowing the imposition of constraints, such as bounding the dimension via a prior, which in effect works as a penalty To implement our methodology, we use a Markov Chain Monte Carlo (MCMC) method. We demonstrate the use of the methodology to diffuse large B-cell lymphoma (DLBCL) complementary DNA (cDNA) data and Breast Carcinomas data.

• Journal of the Korean Data and Information Science Society
• /
• 제20권5호
• /
• pp.809-818
• /
• 2009

협력적 필터링 기법은 전자상거래에서 거래되는 아이템에 대하여 고객들이 평가한 선호 정보를 이용하여 특정 상품에 대한 선호도 예측 대상 고객의 선호도를 예측하는 기법이다. 협력적 필터링 기법을 통한 예측 정확도를 향상시키기 위해서는 예측에 이용할 수 있는 고객들의 선호 정보를 충분히 확보하여야 한다. 그러나 과도한 이웃 고객의 선호 정보는 오히려 예측 정확도에 부정적 영향을 미치며 또한 과소 정보 역시 예측 정확도 감소에 영향을 미칠 수 있다. 본 연구에서는 협력적 필터링 알고리즘 적용에 있어 k명의 근접 이웃을 결정하는 이웃 선정방법을 개선하였으며 개별 고객의 선호도 평가 정보를 이용하여 적정 이웃 수를 결정할 수 있는 방법을 제시한다. 본 연구의 결과는 근접 이웃 수 결정을 위한 기존 방법인 탐색적 방법을 개선함과 동시에 선호도 예측 정확도를 향상시키는데 유용한 방법을 제공할 수 있다.

• Journal of Computing Science and Engineering
• /
• 제1권2호
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

• International Journal of Computer Science & Network Security
• /
• 제22권6호
• /
• pp.230-240
• /
• 2022

Sharing of online videos via internet is an emerging and important concept in different types of applications like surveillance and video mobile search in different web related applications. So there is need to manage personalized web video retrieval system necessary to explore relevant videos and it helps to peoples who are searching for efficient video relates to specific big data content. To evaluate this process, attributes/features with reduction of dimensionality are computed from videos to explore discriminative aspects of scene in video based on shape, histogram, and texture, annotation of object, co-ordination, color and contour data. Dimensionality reduction is mainly depends on extraction of feature and selection of feature in multi labeled data retrieval from multimedia related data. Many of the researchers are implemented different techniques/approaches to reduce dimensionality based on visual features of video data. But all the techniques have disadvantages and advantages in reduction of dimensionality with advanced features in video retrieval. In this research, we present a Novel Intent based Dimension Reduction Semi-Supervised Learning Approach (NIDRSLA) that examine the reduction of dimensionality with explore exact and fast video retrieval based on different visual features. For dimensionality reduction, NIDRSLA learns the matrix of projection by increasing the dependence between enlarged data and projected space features. Proposed approach also addressed the aforementioned issue (i.e. Segmentation of video with frame selection using low level features and high level features) with efficient object annotation for video representation. Experiments performed on synthetic data set, it demonstrate the efficiency of proposed approach with traditional state-of-the-art video retrieval methodologies.

• 한국항만경제학회지
• /
• 제33권4호
• /
• pp.37-58
• /
• 2017

설문조사 및 응답자의 지각을 바탕으로 하는 항만선택연구의 암묵적인 가정은 항만선택속성들의 선호크기가 선택행위에 비례적이라는 것이다. 그러나 항만선택 속성들도 직선만이 아닌 비선형적 특성을 갖을 수 있다. 본 연구는 항만선택연구에 성격이 유사한 카노모형을 원용하여 항만선택속성의 비선형적 특성을 확인 하였다. 연구결과 선사의 항만선택속성들중 복합운송연계성과 항만규모 등이 당연특성으로 평가되는 등 여러 속성들이 비선형적 특성으로 평가되었다. 따라서 항만공사와 운영사 등의 항만 서비스제공자들은 선사들의 비선형적 항만선택특성을 반영한 항만운영전략을 구축해야 할 것이다. 본 연구가 항만선택 특성을 탐색적으로 분석하였기 때문에 추후 국내외 항만 및 이해당사자들을 대상으로 한 추가적인 검증연구가 필요하다. 또한 분석 및 전략수립에 활용한 카노모형 및 중요도 선택분석방법도 명확한 특성의 파악과 전략지침의 제시가 가능하도록 개선할 필요가 있다.

• 한국정보시스템학회지:정보시스템연구
• /
• 제26권3호
• /
• pp.63-90
• /
• 2017

Purpose This study proposes a novel system trading model using case-based reasoning (CBR) based on absolute similarity threshold. The proposed model is designed to optimize the absolute similarity threshold, feature selection, and instance selection of CBR by using genetic algorithm (GA). With these mechanisms, it enables us to yield higher returns from stock market trading. Design/Methodology/Approach The proposed CBR model uses the absolute similarity threshold varying from 0 to 1, which serves as a criterion for selecting appropriate neighbors in the nearest neighbor (NN) algorithm. Since it determines the nearest neighbors on an absolute basis, it fails to select the appropriate neighbors from time to time. In system trading, it is interpreted as the signal of 'hold'. That is, the system trading model proposed in this study makes trading decisions such as 'buy' or 'sell' only if the model produces a clear signal for stock market prediction. Also, in order to improve the prediction accuracy and the rate of return, the proposed model adopts optimal feature selection and instance selection, which are known to be very effective in enhancing the performance of CBR. To validate the usefulness of the proposed model, we applied it to the index trading of KOSPI200 from 2009 to 2016. Findings Experimental results showed that the proposed model with optimal feature or instance selection could yield higher returns compared to the benchmark as well as the various comparison models (including logistic regression, multiple discriminant analysis, artificial neural network, support vector machine, and traditional CBR). In particular, the proposed model with optimal instance selection showed the best rate of return among all the models. This implies that the application of CBR with the absolute similarity threshold as well as the optimal instance selection may be effective in system trading from the perspective of returns.