An Approach to Predict Impact of Proposed Engineering Change Effect

2012 ◽  
Vol 12 (2) ◽  
Author(s):  
Chandresh Mehta ◽  
Lalit Patil ◽  
Debasish Dutta
Keyword(s):  
Success Rate ◽  
Nearest Neighbor ◽  
State Of The Art ◽  
Bayes Rule ◽  
Local Similarity ◽  
K Nearest Neighbor ◽  
Engineering Change ◽  
Detailed Evaluation ◽  
Evaluation Metric ◽  
The Impact

Detailed evaluation of a proposed engineering change (EC) or its effects is a time-consuming process requiring considerable user experience and expertise. Therefore, enterprises plan detailed evaluation of only those EC effects that might have a significant impact. Since similar ECs are likely to have similar effects and impacts, past EC knowledge can be utilized for determining whether the proposed EC effect has significant impact. This paper presents an approach for predicting the impact of proposed EC effect based on past ECs that are similar to it. Our approach accounts for the differences in context of impact between attribute values in two changes. The Bayes’ rule is utilized to determine differences in impact value based on the differences in attribute values. The probability values required in Bayes’ rule are determined based on the principle of minimum cross entropy. An example EC knowledge base is created and utilized to evaluate our approach against two state-of-the-art approaches, namely k-nearest neighbor (NN) and regularized local similarity discriminant analysis (SDA). The success rate in predicting impact is used as an evaluation metric. The results show that there is a statistically significant improvement in success rate obtained using our approach as compared to those obtained using the two state-of-the-art approaches. The results also show that for a very large number of proposed ECs, i.e., N > 100, the success rate in predicting impact using our approach shall be greater than that obtained using the two state-of-the-art approaches.

An Approach to Determine Important Attributes for Engineering Change Evaluation

2013 ◽  
Vol 135 (4) ◽  
Author(s):  
Chandresh Mehta ◽  
Lalit Patil ◽  
Debasish Dutta
Keyword(s):  
Optimization Problem ◽  
State Of The Art ◽  
Evaluation Criteria ◽  
Engineering Change ◽  
Knowledge Based ◽  
Detailed Evaluation ◽  
Change Impact ◽  
Search Approach ◽  
The Impact ◽  
Better Than

Enterprises plan detailed evaluation of only those engineering change (EC) effects that might have a significant impact. Using past EC knowledge can prove effective in determining whether a proposed EC effect has significant impact. In order to utilize past EC knowledge, it is essential to identify important attributes that should be compared to compute similarity between ECs. This paper presents a knowledge-based approach for determining important EC attributes that should be compared to retrieve similar past ECs so that the impact of proposed EC effect can be evaluated. The problem of determining important EC attributes is formulated as the multi-objective optimization problem. Measures are defined to quantify importance of an attribute set. The knowledge in change database and the domain rules among attribute values are combined for computing the measures. An ant colony optimization (ACO)-based search approach is used for efficiently locating the set of important attributes. An example EC knowledge-base is created and used for evaluating the measures and the overall approach. The evaluation results show that our measures perform better than state-of-the-art evaluation criteria. Our overall approach is evaluated based on manual observations. The results show that our approach correctly evaluates the value of proposed change impact with a success rate of 83.33%.

Handwritten Balinesse Character Recognition using K-Nearest Neighbor

2018 ◽  
Author(s):  
I Wayan Agus Surya Darma
Keyword(s):  
Feature Extraction ◽  
Success Rate ◽  
Character Recognition ◽  
Nearest Neighbor ◽  
Recognition System ◽  
Extraction Process ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Algorithm ◽  
K Nearest Neighbor Algorithm ◽  
Character Feature

Balinese character recognition is a technique to recognize feature or pattern of Balinese character. Feature of Balinese character is generated through feature extraction process. This research using handwritten Balinese character. Feature extraction is a process to obtain the feature of character. In this research, feature extraction process generated semantic and direction feature of handwritten Balinese character. Recognition is using K-Nearest Neighbor algorithm to recognize 81 handwritten Balinese character. The feature of Balinese character images tester are compared with reference features. Result of the recognition system with K=3 and reference=10 is achieved a success rate of 97,53%.

Performance Analysis of Pose Invariant Face Recognition Approaches in Unconstrained Environments

2015 ◽  
Vol 5 (1) ◽  
pp. 66-81 ◽  
Author(s):  
M. Parisa Beham ◽  
S. M. Mansoor Roomi ◽  
J. Alageshan ◽  
V. Kapileshwaran
Keyword(s):  
Face Recognition ◽  
Nearest Neighbor ◽  
State Of The Art ◽  
Recognition Algorithm ◽  
K Nearest Neighbor ◽  
Research Issues ◽  
Histograms Of Oriented Gradients ◽  
Recognition Phase ◽  
The Face ◽  
Pose Variation

Face recognition and authentication are two significant and dynamic research issues in computer vision applications. There are many factors that should be accounted for face recognition; among them pose variation is a major challenge which severely influence in the performance of face recognition. In order to improve the performance, several research methods have been developed to perform the face recognition process with pose invariant conditions in constrained and unconstrained environments. In this paper, the authors analyzed the performance of a popular texture descriptors viz., Local Binary Pattern, Local Derivative Pattern and Histograms of Oriented Gradients for pose invariant problem. State of the art preprocessing techniques such as Discrete Cosine Transform, Difference of Gaussian, Multi Scale Retinex and Gradient face have also been applied before feature extraction. In the recognition phase K- nearest neighbor classifier is used to accomplish the classification task. To evaluate the efficiency of pose invariant face recognition algorithm three publicly available databases viz. UMIST, ORL and LFW datasets have been used. The above said databases have very wide pose variations and it is proved that the state of the art method is efficient only in constrained situations.

scholarly journals The Impact of Emotional Music on Active ROI in Patients with Depression Based on Deep Learning: A Task-State fMRI Study

2019 ◽  
Vol 2019 ◽  
pp. 1-14
Author(s):  
Renzhou Gui ◽  
Tongjie Chen ◽  
Han Nie
Keyword(s):  
Neural Network ◽  
Deep Learning ◽  
Correlation Matrix ◽  
Nearest Neighbor ◽  
Learning Model ◽  
Fmri Data ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
The Impact ◽  
Deep Learning Model

With the continuous development of science, more and more research results have proved that machine learning is capable of diagnosing and studying the major depressive disorder (MDD) in the brain. We propose a deep learning network with multibranch and local residual feedback, for four different types of functional magnetic resonance imaging (fMRI) data produced by depressed patients and control people under the condition of listening to positive- and negative-emotions music. We use the large convolution kernel of the same size as the correlation matrix to match the features and obtain the results of feature matching of 264 regions of interest (ROIs). Firstly, four-dimensional fMRI data are used to generate the two-dimensional correlation matrix of one person’s brain based on ROIs and then processed by the threshold value which is selected according to the characteristics of complex network and small-world network. After that, the deep learning model in this paper is compared with support vector machine (SVM), logistic regression (LR), k-nearest neighbor (kNN), a common deep neural network (DNN), and a deep convolutional neural network (CNN) for classification. Finally, we further calculate the matched ROIs from the intermediate results of our deep learning model which can help related fields further explore the pathogeny of depression patients.

scholarly journals Application of Deep Convolutional Neural Networks and Smartphone Sensors for Indoor Localization

2019 ◽  
Vol 9 (11) ◽  
pp. 2337 ◽  
Author(s):  
Imran Ashraf ◽  
Soojung Hur ◽  
Yongwan Park
Keyword(s):  
Magnetic Field ◽  
Nearest Neighbor ◽  
Indoor Localization ◽  
Scene Recognition ◽  
Localization Error ◽  
K Nearest Neighbor ◽  
Current Location ◽  
Smartphone Sensors ◽  
The Impact ◽  
Localization Systems

Indoor localization systems are susceptible to higher errors and do not meet the current standards of indoor localization. Moreover, the performance of such approaches is limited by device dependence. The use of Wi-Fi makes the localization process vulnerable to dynamic factors and energy hungry. A multi-sensor fusion based indoor localization approach is proposed to overcome these issues. The proposed approach predicts pedestrians’ current location with smartphone sensors data alone. The proposed approach aims at mitigating the impact of device dependency on the localization accuracy and lowering the localization error in the magnetic field based localization systems. We trained a deep learning based convolutional neural network to recognize the indoor scene which helps to lower the localization error. The recognized scene is used to identify a specific floor and narrow the search space. The database built of magnetic field patterns helps to lower the device dependence. A modified K nearest neighbor (mKNN) is presented to calculate the pedestrian’s current location. The data from pedestrian dead reckoning further refines this location and an extended Kalman filter is implemented to this end. The performance of the proposed approach is tested with experiments on Galaxy S8 and LG G6 smartphones. The experimental results demonstrate that the proposed approach can achieve an accuracy of 1.04 m at 50 percent, regardless of the smartphone used for localization. The proposed mKNN outperforms K nearest neighbor approach, and mean, variance, and maximum errors are lower than those of KNN. Moreover, the proposed approach does not use Wi-Fi for localization and is more energy efficient than those of Wi-Fi based approaches. Experiments reveal that localization without scene recognition leads to higher errors.

Optimized Cost Model for k-NN Queries in R*-Trees over Random Distribution

2011 ◽  
Vol 403-408 ◽  
pp. 3315-3321
Author(s):  
Sirisala Nageswara Rao
Keyword(s):  
Nearest Neighbor ◽  
Cost Model ◽  
Neighbor Join ◽  
Multidimensional Data ◽  
Analysis Model ◽  
K Nearest Neighbor ◽  
Storage And Retrieval ◽  
Key Issues ◽  
Improved Performance ◽  
The Impact

Efficient storage and retrieval of multidimensional data in large volumes has become one of the key issues in the design and implementation of commercial and application software. The kind of queries posted on such data is also multifarious. Nearest neighbor queries are one such category and have more significance in GIS type of application. R-tree and its sequel are data partitioned hierarchical multidimensional indexing structures that help in this purpose. Today’s research has turned towards the development of powerful analytical method to predict the performance of such indexing structures such as for varies categories of queries such as range, nearest neighbor, join, etc .This paper focuses on performance of R*-tree for k nearest neighbor (kNN) queries. While general approaches are available in literature that works better for larger k over uniform data, few have explored the impact of small values of k. This paper proposes improved performance analysis model for kNN query for small k over random data. The results are tabulated and compared with existing models, the proposed model out performs the existing models in a significant way for small k

scholarly journals Impact of a pulsed xenon disinfection system on hospital onset Clostridioides difficile infections in 48 hospitals over a 5-year period

2021 ◽  
Vol 21 (1) ◽  
Author(s):  
Sarah Simmons ◽  
Grady Wier ◽  
Antonio Pedraza ◽  
Mark Stibich
Keyword(s):  
Nearest Neighbor ◽  
Negative Binomial ◽  
Learning Algorithm ◽  
Compliance Rate ◽  
Negative Binomial Regression ◽  
Inverse Association ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Clostridioides Difficile ◽  
The Impact

Abstract Background The role of the environment in hospital acquired infections is well established. We examined the impact on the infection rate for hospital onset Clostridioides difficile (HO-CDI) of an environmental hygiene intervention in 48 hospitals over a 5 year period using a pulsed xenon ultraviolet (PX-UV) disinfection system. Methods Utilization data was collected directly from the automated PX-UV system and uploaded in real time to a database. HO-CDI data was provided by each facility. Data was analyzed at the unit level to determine compliance to disinfection protocols. Final data set included 5 years of data aggregated to the facility level, resulting in a dataset of 48 hospitals and a date range of January 2015–December 2019. Negative binomial regression was used with an offset on patient days to convert infection count data and assess HO-CDI rates vs. intervention compliance rate, total successful disinfection cycles, and total rooms disinfected. The K-Nearest Neighbor (KNN) machine learning algorithm was used to compare intervention compliance and total intervention cycles to presence of infection. Results All regression models depict a statistically significant inverse association between the intervention and HO-CDI rates. The KNN model predicts the presence of infection (or whether an infection will be present or not) with greater than 98% accuracy when considering both intervention compliance and total intervention cycles. Conclusions The findings of this study indicate a strong inverse relationship between the utilization of the pulsed xenon intervention and HO-CDI rates.

scholarly journals K-Nearest Neighbor Classification for Detection of The Effect of Game Addiction on Cognitive Activity in The Late Adolescent Phase based on Brainwave Signals

2019 ◽  
Vol 1 (2) ◽  
pp. 46-62
Author(s):  
Ahmad Azhari ◽  
Ajie Kurnia Saputra Swara
Keyword(s):  
Cognitive Abilities ◽  
Nearest Neighbor ◽  
Cognitive Activity ◽  
World Health ◽  
Gaming Disorder ◽  
Negative Consequences ◽  
K Nearest Neighbor ◽  
Late Adolescent ◽  
Game Addiction ◽  
The Impact

World Health Organization (WHO) has determined that Gaming disorder is included in the International Classification of Diseases (ICD-11). The behavior of playing digital games included in the Gaming disorder category is characterized by impaired control of the game, increasing the priority given to the game more than other activities insofar as the game takes precedence over other daily interests and activities, and the continuation or improvement of the game despite negative consequences. The influence of video games on children's development has always been a polemic because in adolescence not only adopts cognitive abilities in learning activities, but also various strategies related to managing activities in learning, playing and socializing to improve cognitive abilities. Therefore, this research was conducted to analyze the cognitive activity of late teens in learning and playing games based on brainwave signals and to find out the impact of games on cognitive activity in adolescents. Prediction of the effect of the game on cognitive activity will be done by applying Fast Fourier Transform for feature extraction and K-Nearest Neighbor for classification. The results of the expert assessment showed the percentage of respondents with superior cognitive category but game addiction was 63.3% and respondents with cognitive categorization were average but were addicted by 36.6%. The percentage of accuracy produced by the system shows 80% in games and cognitive by using k values of 1, 6, and 7. The correlation test results show a percentage of 0.089, so it is concluded that there is no influence of the game on cognitive activity in late adolescents.

scholarly journals Photoplethysmography Biometric Recognition Model Based on Sparse Softmax Vector and k-Nearest Neighbor

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Junfeng Yang ◽  
Yuwen Huang ◽  
Fuxian Huang ◽  
Gongping Yang
Keyword(s):  
Nearest Neighbor ◽  
State Of The Art ◽  
Recognition Rate ◽  
K Nearest Neighbor ◽  
Biometric Recognition ◽  
Recognition Model ◽  
The Third ◽  
Model Based ◽  
Current State ◽  
Biometric Trait

Photoplethysmography (PPG) biometric recognition has recently received considerable attention and is considered to be a promising biometric trait. Although some promising results on PPG biometric recognition have been reported, challenges in noise sensitivity and poor robustness remain. To address these issues, a PPG biometric recognition framework is presented in this article, that is, a PPG biometric recognition model based on a sparse softmax vector and k-nearest neighbor. First, raw PPG data are rerepresented by sliding window scanning. Second, three-layer features are extracted, and the features of each layer are represented by a sparse softmax vector. In the first layer, the features are extracted by PPG data as a whole. In the second layer, all the PPG data are divided into four subregions, then four subfeatures are generated by extracting features from the four subregions, and finally, the four subfeatures are averaged as the second layer features. In the third layer, all the PPG data are divided into 16 subregions, then 16 subfeatures are generated by extracting features from the 16 subregions, and finally, the 16 subfeatures are averaged as the third layer features. Finally, the features with first, second, and third layers are combined into three-layer features. Extensive experiments were conducted on three PPG datasets, and it was found that the proposed method can achieve a recognition rate of 99.95%, 97.21%, and 99.92% on the respective sets. The results demonstrate that the proposed method can outperform current state-of-the-art methods in terms of accuracy.

scholarly journals An RSSD-Based Fingerprint Positioning Method for Detection of an Unknown Radio Transmitter Using WLS and Factor Graph

2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Liyang Zhang ◽  
Taihang Du ◽  
Chundong Jiang
Keyword(s):  
Nearest Neighbor ◽  
Access Point ◽  
Reference Points ◽  
Least Square ◽  
Factor Graph ◽  
K Nearest Neighbor ◽  
Positioning Accuracy ◽  
Radio Transmitter ◽  
Error Weight ◽  
The Impact

Realizing accurate detection of an unknown radio transmitter (URT) has become a challenge problem due to its unknown parameter information. A method based on received signal strength difference (RSSD) fingerprint positioning technique and using factor graph (FG) has been successfully developed to achieve the localization of an URT. However, the RSSD-based FG model is not accurate enough to express the relationship between the RSSD and the corresponding location coordinates since the RSSD variances of reference points are different in practice. This paper proposes an enhanced RSSD-based FG algorithm using weighted least square (WLS) to effectively reduce the impact of RSSD measurement variance difference on positioning accuracy. By the use of stochastic RSSD errors between the measured value and the estimated value of the selected reference points, we utilize the error weight matrix to establish a new WLSFG model. Then, the positioning process of proposed RSSD-WLSFG algorithm is derived with the sum-product principle. In addition, the paper also explores the effects of different access point (AP) numbers and grid distances on positioning accuracy. The simulation experiment results show that the proposed algorithm can obtain the best positioning performance compared with the conventional RSSD-based K nearest neighbor (RSSD-KNN) and RSSD-FG algorithms in the case of different AP numbers and grid distances.

Sign in / Sign up

Export Citation Format

Share Document