• ETRI Journal
• /
• v.43 no.6
• /
• pp.966-977
• /
• 2021

Filterbank multicarrier with offset quadrature amplitude modulation (FBMC-OQAM) is an attractive alternative to the orthogonal frequency division multiplexing (OFDM) modulation technique. In comparison with OFDM, the FBMC-OQAM signal has better spectral confinement and higher spectral efficiency and tolerance to synchronization errors, primarily due to per-subcarrier filtering using a frequency-time localized prototype filter. However, the filtering process introduces intrinsic interference among the symbols and complicates channel estimation (CE). An efficient way to improve the CE in FBMC-OQAM is using a technique known as windowed frequency domain averaging (FDA); however, it requires a priori knowledge of the window length parameter which is set based on the channel's frequency selectivity (FS). As the channel's FS is not fixed and not a priori known, we propose a k-nearest neighbor-based machine learning algorithm to classify the FS and decide on the FDA's window length. A comparative theoretical analysis of the mean-squared error (MSE) is performed to prove the proposed CE scheme's effectiveness, validated through extensive simulations. The adaptive CE scheme is shown to yield a reduction in CE-MSE and improved bit error rates compared with the popular preamble-based CE schemes for FBMC-OQAM, without a priori knowledge of channel's frequency selectivity.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.728-735
• /
• 2022

Roofers get exposed to increased risk of knee musculoskeletal disorders (MSDs) at different phases of a sloped shingle installation task. As different phases are associated with different risk levels, this study explored the application of machine learning for automated classification of seven phases in a shingle installation task using knee kinematics and roof slope information. An optical motion capture system was used to collect knee kinematics data from nine subjects who mimicked shingle installation on a slope-adjustable wooden platform. Four features were used in building a phase classification model. They were three knee joint rotation angles (i.e., flexion, abduction-adduction, and internal-external rotation) of the subjects, and the roof slope at which they operated. Three ensemble machine learning algorithms (i.e., random forests, decision trees, and k-nearest neighbors) were used for training and prediction. The simulations indicate that the k-nearest neighbor classifier provided the best performance, with an overall accuracy of 92.62%, demonstrating the considerable potential of machine learning methods in detecting shingle installation phases from workers knee joint rotation and roof slope information. This knowledge, with further investigation, may facilitate knee MSD risk identification among roofers and intervention development.

• Journal of Korean Society of Forest Science
• /
• v.96 no.3
• /
• pp.259-268
• /
• 2007

This study was conducted to produce forest thematic maps and estimate forest statistics for Pyeongchang Gun using the kNN technique, which has been applied to produce thematic maps of variables of interest including unobserved plots by combining field plot data, remotely sensed data and other digital map data in forest inventories. The estimation errors for three horizontal reference areas (HRAs), whose radii are 20, 40 and 60 km respectively, were compared. Although the precision for the 40 km radius was lower compared to that for the 60 km radius, the 40 km radius was found to be an efficient HRA because their difference in precision was modest. At a value of k=5 nearest neighbors for the selected HRA, the overall accuracy was high. As a result, using the k=5 neighbors within the HRA of 40 km radius, thematic maps of number of trees, basal area, and growing stock per hectare were generated. As compared to the forest statistics based on field sample plots, the estimated means of each parameter from the produced maps were underestimated.

• The Journal of Korean Association of Computer Education
• /
• v.18 no.4
• /
• pp.55-62
• /
• 2015

Recommender systems through collaborative filtering has been utilized successfully in various areas by providing with convenience in searching information. Measuring similarity is critical in determining performance of these systems, because it is the criteria for the range of recommenders. This study analyzes distributions of similarity from traditional measures and investigates relations between similarities and the number of co-rated items. With this, this study suggests a method for selecting reliable recommenders by restricting similarities, which compensates for the drawbacks of previous measures. Experimental results showed that restricting similarities of neighbors by upper and lower thresholds yield superior performance than previous methods, especially when consulting fewer nearest neighbors. Maximum improvement of 0.047 for cosine similarity and that of 0.03 for Pearson was achieved. This result tells that a collaborative filtering system using Pearson or cosine similarities should not consult neighbors with very high or low similarities.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.429-440
• /
• 2005

As rapid improvement in electronic technologies makes sensor hardware more powerful and capable, the application range of sensor networks Is getting to be broader. The main purpose of sensor networks is to monitor the phenomena in interesting regions (e.g., factory warehouses, disaster areas, wild fields, etc) and return required data. The k Nearest Neighbor (KNN) query that finds k objects which are geographically close to the given point is an Important application in sensor networks. However, most previous approaches are either seem to be impractical or are not energy-efficient in resource-limited sensor networks. In this paper. we propose an efficient KNN query processing method in sensor networks. In the proposed method, we dynamically increase searching boundary, if necessary, and traverse nodes inside the boundary until finding k nearest neighbors. Since only the representative sensor nodes are visited, our algorithm reduces a number of messages. We show thorough experiments that the proposed method performs better than the existing method in various network environments.

• The Korean Journal of Applied Statistics
• /
• v.31 no.3
• /
• pp.417-426
• /
• 2018

An alternative developmental toxicity test using mouse embryonic stem cell derived embryoid bodies has been developed. This alternative method is not to administer chemicals to animals, but to treat chemicals with cells. This study suggests the use of Discriminant Analysis, Support Vector Machine, Artificial Neural Network and k-Nearest Neighbor. Algorithm performance was compared with accuracy and a weighted Cohen's kappa coefficient. In application, various classification techniques were applied to cytotoxicity data to classify drug toxicity and compare the results.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1303-1313
• /
• 2015

MapReduce provides high levels of system scalability and fault tolerance for large-size data processing. A MapReduce-based k-nearest-neighbor(k-NN) join algorithm seeks to produce the k nearest-neighbors of each point of a dataset from another dataset. The algorithm has been considered important in bigdata analysis. However, the existing k-NN join query-processing algorithm suffers from a high index-construction cost that makes it unsuitable for the processing of bigdata. To solve the corresponding problems, we propose a new grid-based, k-NN join query-processing algorithm. Our algorithm retrieves only the neighboring data from a query cell and sends them to each MapReduce task, making it possible to improve the overhead data transmission and computation. Our performance analysis shows that our algorithm outperforms the existing scheme by up to seven-fold in terms of the query-processing time, while also achieving high extent of query-result accuracy.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.103-110
• /
• 2005

The performance of maximum likelihood(ML) detection for the given channel is analyzed in spatially multiplexed MIMO system. In order to obtain the vector symbol error rate, we define error vectors which represent the geometrical relation between lattice points. The properties of error vectors are analyzed to show that all lattice points in infinite lattice almost surely have four nearest neighbors after random channel transformation. Using this information and minimum distance obtained by the modified sphere decoding algorithm, we formulate the analytical performance of vector symbol error over the given channel. To verify the result, we simulate ML performance over various random channel which are classified into three categories: unitary channel, dense channel, and sparse channel. From the simulation results, it is verified that the derived analytical result gives a good approximation about the performance of ML detector over the all random MIMO channels.