• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.1
• /
• pp.48.1-48.1
• /
• 2015

We investigate the role of small-scale and large-scale environments in triggering nuclear activity of the local galaxies using a volume-limited sample with $M_r$ < -19.5 and 0.02 < z < 0.0685 from the Sloan Digital Sky Survey Data Release 7. To fix the mass of the supermassive black hole in its host galaxy, we limit the central velocity dispersion of the sample galaxies. The active galactic nuclei (AGN) host sample is composed of Type II AGNs identified with flux ratios of narrow emission lines with S/N > 6. In this study, we find that the AGN fraction of late-type host galaxies are commonly larger than of early type galaxies. The AGN fraction of host galaxy with late-type nearest neighbor starts to increase as the host galaxy approaches the virial radius of the nearest neighbor (about a few hundred kpc scale). Our result may support the idea that the hydrodynamic interaction with the nearest neighbor plays an important role in triggering the nuclear activity of galaxy. The early-type galaxies in high density regions show decline of AGN activity compared to ones in lower density regions, whereas the direction of the environmental dependence of AGN activity for late-type galaxies is rather opposite. We also find that the environmental dependence of star formation rate is analogous to one of AGN activity except in the high density region.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.405-410
• /
• 2009

This paper proposes an efficient path finding scheme capable of searching the paths to k static objects from a given query point, aiming at both improving the legacy k-nearest neighbor search and making it easily applicable to the road network environment. To the end of improving the speed of finding one-to-many paths, the modified A* obviates the duplicated part of node scans involved in the multiple executions of a one-to-one path finding algorithm. Additionally, the cost to the each object found in this step makes it possible to finalize the k objects according to the network distance from the candidate set as well as to order them by the path cost. Experiment results show that the proposed scheme has the accuracy of around 100% and improves the search speed by $1.3{\sim}3.0$ times of k-nearest neighbor searches, compared with INE, post-Dijkstra, and $na{\ddot{i}}ve$ method.

• Journal of Digital Contents Society
• /
• v.15 no.1
• /
• pp.129-136
• /
• 2014

Wi-Fi fingerprinting system is a very popular positioning method used in indoor spaces. The system depends on Wi-Fi Received Signal Strength (RSS) from Access Points (APs). However, the Wi-Fi RSS is changeable by multipath fading effect and interference due to walls, obstacles and people. Therefore, the Wi-Fi fingerprinting system produces low position accuracy. Also, Wi-Fi signals pass through walls. For this reason, the existing system cannot distinguish users' floor. To solve these problems, this paper proposes a LED fingerprinting system for accurate indoor positioning. The proposed system uses a received optical power from LEDs and LED-Identification (LED-ID) instead of the Wi-Fi RSS. In training phase, we record LED fingerprints in database at each place. In serving phase, we adopt a K-Nearest Neighbor (K-NN) algorithm for comparing existing data and new received data of users. We show that our technique performs in terms of CDF by computer simulation results. From simulation results, the proposed system shows that a positioning accuracy is improved by 8.6 % on average.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.632-642
• /
• 2001

The nearest neighbor query is an important operation widely used in multimedia databases for finding the object that is most similar to a given object Most of techniques for processing nearest neighbor queries employ multidimensional indexes for effective indexing of objects. However, the performance of previous multidimensional indexes, which use N-dimensional rectangles or spheres for representing the capsule of the object cluster, deteriorates seriously as th number of dimensions gets higher, In this paper we first point out the fact that the simple representation of capsuler incurs performance degradation in processing nearest neighbor queries. For alleviating this problem,. we propose(1) adopting new axis systems appropriate to a given cluster (2) representing various shapes of capsules by combining rectangles and spheres, and (3) maintaining outliers separately, We also verify the superiority of our approach through performance evaluation by performing extensive experiments.

• Communications for Statistical Applications and Methods
• /
• v.15 no.6
• /
• pp.977-991
• /
• 2008

This study is about the k-nearest neighbor-based approach for the estimation of mutual information when the type of target variable is categorical and continuous. The results of Monte-Carlo simulation and experiments with real-world data show that k=1 is preferable. In practical application with real world data, our study shows that jittering and bootstrapping is needed.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.3
• /
• pp.52-58
• /
• 2002

The purpose of condition monitoring and fault diagnosis is to detect faults occurring in machinery in order to improve the level of safety in plants and reduce operational and maintenance costs. The recognition performance is important not only to gain a high recognition rate bur a1so to minimize the diagnosis failures error rate by using off effective rejection module. We examined the problem of performance evaluation for the rejection scheme considering the accuracy of individual c1asses in order to increase the recognition performance. We use the Smith's method among the previous studies related to rejection method. Nearest neighbor classifier is used for classifying the machine conditions from the vibration signals. The experiment results for the performance evaluation of rejection show the modified optimum rejection method is superior to others.

• Journal of the Korean Society of Safety
• /
• v.15 no.2
• /
• pp.1-7
• /
• 2000

This paper presents the approach involving fault detection and diagnosis of gears using pattern recognition and Wavelet transform. It describes result of the comparison between KDI (Kullback Discrimination Information) with the nearest neighbor classification rule as one of pattern recognition methods and Wavelet transform to know a way to detect and diagnosis of gear damages experimentally. To model the damages 1) Normal (no defect), 2) one tooth is worn out, 3) All teeth faces are worn out 4) One tooth is broken. The vibration sensor was attached on the bearing housing. This produced the total time history data that is 20 pieces of each condition. We chose the standard data and measure distance between standard and tested data. In Wavelet transform analysis method, the time series data of magnitude in specified frequency (rotary and mesh frequency) were earned. As a result, the monitoring system using Wavelet transform method and KDI with nearest neighbor classification rule successfully detected and classified the damages from the experimental data.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.269-280
• /
• 2004

The Pyramid-Technique is based on mapping n-dimensional space data into one-dimensional data and expresses it as a B+-tree. By solving the problem of search time complexity the pyramid technique also prevents the effect of "phenomenon of dimensional curse" which is caused by treatment of hypercube range query in n-dimensional data space. The SPY-TEC applies the space division strategy in pyramid method and uses spherical range query suitable for similarity search so that Improves the search performance. However, nearest neighbor query is more efficient than range query because it is difficult to specify range in similarity search. Previously proposed index methods perform well only in the specific distribution of data. In this paper, we propose an efficient searching technique for nearest neighbor object using PdR-Tree suggested to improve the search performance for high dimensional data such as multimedia data. Test results, which uses simulation data with various distribution as well as real data, demonstrate that PdR-Tree surpasses both the Pyramid-Technique and SPY-TEC in views of search performance.rformance.

• Journal of the Korea Safety Management & Science
• /
• v.11 no.1
• /
• pp.27-33
• /
• 2009

A study of fracture to material is getting interest in nuclear and aerospace industry as a viewpoint of safety. Acoustic emission (AE) is a non-destructive testing and new technology to evaluate safety on structures. In previous research continuously, all tensile tests on the pre-defected coupons were performed using the universal testing machine, which machine crosshead was move at a constant speed of 5mm/min. This study is to evaluate an AE source characterization of SM45C steel by using k-nearest neighbor classifier, k-NNC. For this, we used K-means clustering as an unsupervised learning method for obtained multi -variate AE main data sets, and we applied k-NNC as a supervised learning pattern recognition algorithm for obtained multi-variate AE working data sets. As a result, the criteria of Wilk's $\lambda$, D&B(Rij) & Tou are discussed.

• Journal of Intelligence and Information Systems
• /
• v.20 no.1
• /
• pp.121-131
• /
• 2014

Traffic speed is an important measure in transportation. It can be employed for various purposes, including traffic congestion detection, travel time estimation, and road design. Consequently, accurate speed prediction is essential in the development of intelligent transportation systems. In this paper, we present an analysis and speed prediction of a certain road section in Busan, South Korea. In previous works, only historical data of the target link are used for prediction. Here, we extract features from real traffic data by considering the neighboring links. After obtaining the candidate features, linear regression, model tree, and k-nearest neighbor (k-NN) are employed for both feature selection and speed prediction. The experiment results show that k-NN outperforms model tree and linear regression for the given dataset. Compared to the other predictors, k-NN significantly reduces the error measures that we use, including mean absolute percentage error (MAPE) and root mean square error (RMSE).