Walsh Transform based Feature vector generation for Image Database Classification

The task of extracting the used feature vector in mining tasks (classification, clustering …etc.) is considered the most important task for enhancing the text processing capabilities. This paper proposes a novel approach to be used in building the feature vector used in web text document classification process; adding semantics in the generated feature vector. This approach is based on utilizing the benefit of the hierarchal structure of the WordNet ontology, to eliminate meaningless words from the generated feature vector that has no semantic relation with any of WordNet lexical categories; this leads to the reduction of the feature vector size without losing information on the text, also enriching the feature vector by concatenating each word with its corresponding WordNet lexical category. For mining tasks, the Vector Space Model (VSM) is used to represent text documents and the Term Frequency Inverse Document Frequency (TFIDF) is used as a term weighting technique. The proposed ontology based approach was evaluated against the Principal component analysis (PCA) approach, and against an ontology based reduction technique without the process of adding semantics to the generated feature vector using several experiments with five different classifiers (SVM, JRIP, J48, Naive-Bayes, and kNN). The experimental results reveal the effectiveness of the authors' proposed approach against other traditional approaches to achieve a better classification accuracy F-measure, precision, and recall.

Aim: Prediction of coronary illness utilizing novel Novel k nearest neighbor (KNN) and contrasting its accuracy with decision tree algorithm. Materials and Methods: Two gatherings are proposed for foreseeing the accuracy (%) of coronary illness. To be specific, novel Novel k nearest neighbor and decision tree algorithm. Here we take 20 examples each for assessment and look at. The sample size was calculated using G power with pretest power at 80% and the alpha of 0.05 value. Result: The decision tree gives better accuracy (84.95%) contrasted with the Novel k nearest neighbor accuracy (76.29 %). Along these lines the factual meaning of the decision tree is superior to the novel k nearest neighbor algorithm with significance value of 0.115. Conclusion: From the outcome, it may very well be inferred that the decision tree helps in anticipating the coronary illness with more precision contrasted with the novel k nearest neighbor algorithm.

Introduction: Propensity score matching (PSM) is a method to reduce the impact of essential and confounders. When the number of confounders is high, there may be a problem of matching, in which, finding matched pairs for the case group is difficult, or impossible. The propensity score (PS) minimizes the effect of the confounders, and it is reduced to one dimension. There are various algorithms in the field of PSM. This study aimed to compared the nearest neighbor and caliper algorithms. Methods: Data obtained in this study were from patients undergoing angiography at Ghaem Hospital in Mashhad, between 2011-12. The study was a retrospective case-control using PSM. In total, 604 patients were included in the case and control groups. A logistic regression model was used to calculate the propensity score and adjust the variables, such as age, gender, Body Mass Index (BMI), systolic blood pressure, smoking status, and triglyceride. Then, the Odds Ratios (ORs) with 95% Confidence Intervals (CIs) for the raw data and two matching algorithms were determined to examine the relationship between type 2 diabetes and coronary artery disease (CAD). Results: Propensity score in the nearest neighbor and caliper algorithms matched the total number of 604 samples, 200 and 178 pairs, respectively. All variables were significantly different between the two groups before matching (P<0.05). The gender was significantly different between the two groups after matching using the nearest neighbor algorithm (P=0.002). No variables created a significant difference between the two groups after matching with the caliper algorithm. Conclusion: Bias reduction in the caliper algorithm was greater than for the nearest neighbor algorithm for all variables except the triglyceride variable.

Content-based search and retrieval of video data has become a challenging and important issue. Different methods[1,2,3] have been proposed to develop video retrievals systems to achieve better performance in terms of accuracy. The proposed technique uses wavelettransforms that areCosine Wavelet Transform, Walsh, Kekre, Slant and Hartley Wavelet Transform. The benefit of energy compaction of fewer transformedcoefficients is taken to reduce the feature vector size by taking fractional coefficients[5]of transformed frames of video. Smaller feature vector size results in less time for comparison of feature vectors resulting in faster retrieval of images. The feature vectors are extracted and coefficients sets are considered as feature vectors (100%, 6.25%, 3.125%, 1.5625%, 0.7813%, 0.39%, 0.195%, 0.097%, 0.048%, 0.024%, 0.012%, 0.006% and 0.003% of complete transformed coefficients).The database consists of 500 videos spread across 10 categories.Performance using wavelets is compared with respect to their transforms. In all considered wavelet transform, experimental result show the performance improvement in fractional coefficient of wavelet transform in content based video retrieval as compared to 100% coefficient considered.

Aim: Coronary illness is one of the main sources of mortality in this current world. A basic test in the field of clinical information assessment is the expectation of cardiovascular infection. The fundamental target of this paper is to work on the exactness of the Data mining algorithms being used to improve heart disease prediction. We will be comparing the novel Random forest with K Nearest Neighbor to find out which of these can give us the best accuracy. Material and Methods: The study used 98 samples with Novel Random Forest and K Nearest Neighbor is executed with varying training and testing splits for predicting the accuracy for heart disease prediction with the 80% of G-power value and data about cardiovascular disease was gathered from numerous web sources, including latest research findings and threshold 0.05%, confidence interval 95% mean and standard deviation. The performance of the accuracy rate of the classifiers is examined using the heart disease dataset.. There was a statistical insignificant difference among Innovative Random Forest and K Nearest Neighbor p = 0.484 (p>0.05). Results and Discussion: The accuracy of predicting heart disease in Novel Random Forest 90.16% and K Nearest Neighbor 67.21% is obtained. Conclusion: Prediction of Heart disease using the innovative Random Forest (RF) technique appears to be a significant improvement over the K Nearest Neighbor (KNN) algorithm in terms of accuracy.

A new vector quantization technique, called storage- and entropy-constrained multi-stage vector quantization (SECMSVQ) technique, is presented for progressive image transmission (PIT) applications. In the SECMSVQ technique, the rate constraint at each stage of the vector quantizer (VQ), and the storage size of the whole VQ are specified independently before the design. A dynamic programming technique is then used to allocate the storage size to each stage of the VQ optimally so that the quantization distortion of the VQ is minimized. The SECMSVQ is well-suited to constructing a PIT system where the transmission time and storage size are the major concerns. Moreover, simulation results show that the SECMSVQ technique can be used effectively to implement signal compression systems under the storage and rate constraints.

Electroencephalograph (EEG) signal analysis is one of the essential for diagnosis of diseases, detect the various event and psychological problems. The accuracy of event detection depends on the feature vectors used. The feature vectors in literature provide performance only for a specific application and perform poor for other application. This paper presents a new feature vector generation using fusion of energy feature vectors of different types. The energy features of alpha, beta and gamma component is extracted as base feature. A fusion rule is formulated to fuse that base features using Hjorth activity features to improve the accuracy of classification. The performance of the proposed new feature is tested on seizures detection, sleep state detection and emotion detection application. The resulting analysis shows that the proposed new feature outperform with improved accuracy of 26% for emotion detection, 5% for seizures detection and 4% for sleep state detection.

This paper describes the implementation of a speaker identification system with reference to Assamese language. The database consists of speech samples that were collected from 15 (fifteen) speakers for ten Assamese words representing the Assamese digits from 0 (shounyo) to 9 (no). Mel Frequency Cepstral Coefficients (MFCC) are used as features for this study. Two independent speaker identification systems have been built in this paper using Vector Quantization (VQ) and I-vector technique. The system built using the I-vector technique obtains comparatively better identification accuracy for speakers when compared with the system developed using VQ technique. Three different systems have been built for both the techniques based on variable feature size. A maximum accuracy of 92.38% is achieved using I-vector technique with 39 MFCC features.

Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance information to compute NN queries (e.g., Euclidean distance or spatial network distance). However, the final goal of a user when performing an NN search is often to travel to one of the points of the search result. In this case, finding the nearest neighbors in terms of travel time is more important than the actual distance. In the existing NN algorithms dynamic real-time events (e.g., traffic congestions, detours, etc.) are usually not considered and hence the pre-computed nearest neighbor objects may not accurately reflect the shortest travel time. In this paper we propose a novel travel time network that integrates both spatial networks and real-time traffic event information. Based on this foundation of the travel time network, we develop a local-based greedy nearest neighbor algorithm and a global-based adaptive nearest neighbor algorithm that both utilize real-time traffic information to provide adaptive nearest neighbor search results. We have performed a theoretical analysis and simulations to verify our methods. The results indicate that our algorithms remarkably reduce the travel time compared with previous nearest neighbor solutions.

Face recognition has been widely used to identify faces according to the patterns of mouth, lip, eyes and so on. Existing face recognition techniques provide a reasonable accuracy. However, their effectiveness significantly degrades in presence of uncontrolled conditions such as variations of background light and image sizes. To deal with this problem, we propose a novel approach based on Classified Vector Quantization (CVQ) technique for face recognition. The new approach divides images into some blocks and each block is classified into several patterns. The Vector Quantization technique (VQ) is applied on the vectors of each pattern. A major benefit of this technique is to consider the geometric structure of face and skin correlations which provide recognition based on changes on human's age. In order to evaluate our approach, experiments on some standard image databases have been conducted. The results demonstrate the high recognition rate and accuracy of our technique.

Important task in image database is to organize images into appropriate category using different features of images. Image classification is studied for many years. There are various techniques proposed to increase the accuracy of classification. In this paper a novel data mining based approach is proposed for content based image classification. Feature extraction and classification algorithms are two main steps in classification process. This paper proposes the use of orthogonal transform to generate the feature vector and to investigate effectiveness of different transforms (Cosine, Sine, and Walsh). Experimentation is carried on different sizes of feature vectors which are formed by taking fractional coefficients. Classification algorithm from different families such as Bayes (Naive Bayes and Bayes Net), Function (RBFNetwork and Simple Logistic), Lazy (IB1 and Kstar), Rule (Decision and Part) and Tree (BFTree, J48 Random Tree and Random Forest) are used for classification. Experimental results and its analysis have shown the Simple Logistic classifier with Walsh transform to be better for proposed data mining based image classification technique.

Recently, spatial partitioning approaches such as spatial pyramid matching (SPM) are commonly used in image classification to collect the global and local features of the images. They divide the input image into small sub-regions (typically in a hierarchical manner) and generate a feature vector for each of them. Although the codes for the descriptors are assigned softly in modern image feature representation techniques, the codes must fall into only a single sub-region when forming the feature vector. In other words, the soft code assignment is used in the descriptor space but the codes are still “hard” voted from the view point of the image space. This paper proposes a spatial soft voting method, in which the existence of the codes are expressed by a Gaussian function and the maps of the existence are sampled to form a feature vector. The generated feature vectors are “soft” both in the descriptor space and the image space. In addition, extra computational cost as compared to SPM is negligibly small. The concept of the spatial soft voting is general and can be applied to most hard spatial partitioning approaches.KeywordsFeature VectorImage SpaceLocal DescriptorSparse CodeCode WordThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

To objectively classify shapes of the human lip vermilion in the lateral view, and to examine whether any morphologic characteristics of dentoskeletal patterns are specific to each classified lip profile pattern. Pretreatment, lateral facial photographs of 234 Japanese women were selected. Investigators with expert knowledge of the anatomic traits of the lip vermilion in the lateral view extracted from images of the face a 13-dimensional feature vector that represented lip vermilion profile shapes. The vector quantization technique was applied to the feature vectors to mathematically optimize the number of lip vermilion profile patterns. Dentoskeletal patterns that corresponded to each classified lip shape were compared statistically. Seven patterns were found, and differences between patterns were notably maximized by the flatness of the anterior portion of the lip vermilion for the upper and lower lip, the position of the most protruded point of the lip vermilion, lip fissure inclination, and differences between the horizontal positions of the upper and lower lip vermilions. The dentoskeletal forms showed significant differences between classified lip vermilion profile patterns (P < .01). (1) Vector quantization revealed that classifying lip vermilion profiles into seven representative patterns was optimal for maximizing differences in the configuration of the lip vermilion. (2) Lip vermilion profile shapes were found to be associated with horizontal lengths of the anterior cranial base, horizontal/vertical positions, inclination and length of the mandible, and horizontal positions and labio-lingual inclinations of the upper and lower incisors.

Background: Text classification techniques are increasingly important with the exponential growth of textual data on the internet. Term Frequency-Inverse Document Frequency (TF-IDF) and Count Vectorizer(CV) are commonly used methods for feature extraction. TF-IDF assigning weights to terms based on their frequency. CV simply counts the occurrences of terms. The performance of CV as well as TF-IDF are evaluated and compared with KNN and DT classifiers across text datasets. Methodology: The investigation begins with preprocessing. The feature vectors are created using both TF-IDF and CV. Feature vectors are passed into the KNN and DT classifiers at in training stage. Experiments are executed the usage of Kaggle's public database Ukraine 10K tweets sentiment_analysis dataset and the Womens ecommerce clothing reviews dataset. Findings: The average of precision, recall, f1 score and accuracy of KNN with TF-IDF were 84.5%, 87%, 83%, 87% respectively and KNN with CV were 83.5%, 87%, 83.5%, 87% respectively. Similarly, average of precision, recall, f1 score and accuracy of DT with TF-IDF were 89%, 89%, 89%, 89% respectively and DT with CV were 89%, 89.5%, 89.5%, 89.5% respectively. The results obtained in this research is consistent with previous similar research result. Conclusions: The performance of TF-IDF is almost similar as CV for a particular dataset and a particular classifier in this study. Novelty: The experiment performed using these classifiers and feature extraction methods on the datasets is a novelty and contribution of this research.

A method to speed up the Bayes classifier