• Communications for Statistical Applications and Methods
• /
• v.22 no.2
• /
• pp.147-157
• /
• 2015

We consider a sparse high-dimensional linear regression model. Penalized methods using LASSO or non-convex penalties have been widely used for variable selection and estimation in high-dimensional regression models. In penalized regression, the selection and prediction performances depend on which penalty function is used. For example, it is known that LASSO has a good prediction performance but tends to select more variables than necessary. In this paper, we propose an additive sparse penalty for variable selection using a combination of LASSO and minimax concave penalties (MCP). The proposed penalty is designed for good properties of both LASSO and MCP.We develop an efficient algorithm to compute the proposed estimator by combining a concave convex procedure and coordinate descent algorithm. Numerical studies show that the proposed method has better selection and prediction performances compared to other penalized methods.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2273-2286
• /
• 2000

In order to acquire the precise and fast response for an analytical query, proper selection of the views to materialize in data warehouse is very crucial. In traditional view selection algorithms, the whole relations are considered to be selected as materialized views. However, materializing the whole relations rather than a part of relations results in much worse performance in terms of time and space cost. Therefore, we present an improved algorithm for selection of views to materialize using clustering method to overcome the problem resulted from conventional view selection algorithms. In the presented algorithm, ASVMRT(Algorithm for Selection of Views to daterialize using Iteduced Table). we first generate reduced tables in clata warehouse using automatic clustering based on attrihute-values density, then we consider the combination of reduced tables as materialized views instead of the combination of the original hase relations. For the justification of the proposecl algorithm. we show the experimental results in which both time and space cost are approximately 1.8 times better than the conventional algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.543-548
• /
• 2017

In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1802-1814
• /
• 2012

In order to guide users to select the most optimal access network in heterogeneous wireless networks, a network selection algorithm is proposed which is designed based on multi-objective discrete particle swarm optimization (Multi-Objective Discrete Particle Swarm Optimization, MODPSO). The proposed algorithm keeps fast convergence speed and strong adaptability features of the particle swarm optimization. In addition, it updates an elite set to achieve multi-objective decision-making. Meanwhile, a mutation operator is adopted to make the algorithm converge to the global optimal. Simulation results show that compared to the single-objective algorithm, the proposed algorithm can obtain the optimal combination performance and take into account both the network state and the user preferences.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.3
• /
• pp.11-18
• /
• 2004

It is making researches in questions selection method for examination in web-based education system. Most questions made for these remote examinations use methods of making questions using fixed questions or randomly using item pools or automatically using degree of difficulty. This paper proposes a new examination questions selection algorithm in web-based education system for engineer test. Generally, Engineer test is characterized by adequate examination questions selection for degree of difficulty and equally between all units. Therefore this algorithm selected examination questions equally well as regards degree of difficulty and distribution between all units. This algorithm providers more effective education examination method as compared with previous algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.574-592
• /
• 2016

Range-free localization algorithm computes a normal node's position by estimating the distance to anchors which know their actual position. In recent years, reliable anchor selection research has been gained a lot of attention because this approach improves localization accuracy by selecting the only subset of anchors called reliable anchor. The distance estimation accuracy and the geometric shape formed by anchors are the two important factors which need to be considered when selecting the reliable anchors. In this paper, we study the relationship between a relative position of three anchors and localization error. From this study, under ideal condition, which is with zero localization error, we find two conditions for anchor selection, thereby proposing a novel anchor selection algorithm that selects three anchors matched most closely to the two conditions, and the validities of the conditions are proved using two theorems. By further employing the conditions, we finally propose a novel range-free localization algorithm. Simulation results show that the proposed algorithm shows considerably improved performance as compared to other existing works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10A
• /
• pp.752-759
• /
• 2009

Cooperative diversity is an effective technique to combat multi-path fading. When this technique is applied to energy-constrained wireless sensor networks, it is a key issue to design appropriate relay selection and power allocation strategies. In this paper, we proposed a new multi-relay selection and power allocation algorithm to maximize network lifetime. The algorithm are composed of two relay selection stages, where the channel condition and residual power of each node were considered in multi-relay selection and the power is fairly allocated proportional to the residual power, satisfies the required SNR at destination and minimizes the total transmit power. In this paper, proposed algorithm is based on AF (amplify and forward) model. We evaluated the proposed algorithm by using extensive simulation and simulation results show that proposed algorithm obtains much longer network lifetime than the conventional algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.2
• /
• pp.87-94
• /
• 2004

The feature subset selection is used as a preprocessing step of a teaming algorithm. If collected data are irrelevant or redundant information, we can improve the performance of learning by removing these data before creating of the learning model. The feature subset selection can also reduce the search space and the storage requirement. This paper proposed a new feature subset selection algorithm that is using the heuristic function based on entropy to evaluate the performance of the abstracted feature subset and feature selection. The ACS algorithm was used as a search method. We could decrease a size of learning model and unnecessary calculating time by reducing the dimension of the feature that was used for learning.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.5
• /
• pp.425-433
• /
• 2012

Dijkstra's algorithm is one of well-known methods to find shortest paths over a network. However, more research on $A^*$ algorithm is necessary to discover the shortest route to a goal point with the heuristic information rather than Dijkstra's algorithm which aims to find a path considering only the shortest distance to any point for an optimal path search. Therefore, in this paper, we compared Dijkstra's algorithm and $A^*$ algorithm for bicycle route selection. For this purpose, the horizontal distance according to slope angle and average speed were calculated based on factors which influence bicycle route selection. And bicycle routes were selected considering the shortest distance or time-dependent shortest path using Dijkstra's or $A^*$ algorithm. The result indicated that the $A^*$ algorithm performs faster than Dijkstra's algorithm on processing time in large study areas. For the future, optimal path selection algorithm can be used for bicycle route plan or a real-time mobile services.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1961-1974
• /
• 2019

In this letter, a harmonic-mean-based dual-antenna selection scheme at relay node is proposed in two-way relaying networks (TWRNs). With well-designed distributed orthogonal concatenated Alamouti space-time block code (STBC), a dual-antenna selection problem based on the instantaneous achievable sum-rate criterion is formulated. We propose a low-complexity selection algorithm based on the harmonic-mean criterion with linearly complexity $O(N_R)$ rather than the directly exhaustive search with complexity $O(N^2_R)$. From the analysis of network outage performance, we show that the asymptotic diversity gain function of the proposed scheme achieves as $1/{\rho}{^{N_R-1}}$, which demonstrates one degree loss of diversity order compared with the full diversity. This slight performance gap is mainly caused by sacrificing some dual-antenna selection freedom to reduce the algorithm complexity. In addition, our proposed scheme can obtain an extra coding gain because of the combination of the well-designed orthogonal concatenated Alamouti STBC and the corresponding dual-antenna selection algorithm. Compared with the common-used selection algorithms in the state of the art, the proposed scheme can achieve the best performance, which is validated by numerical simulations.