Downloads & Free Reading Options - Results

This article is from Journal of NeuroEngineering and Rehabilitation , volume 9 . Abstract Background: Electromyography (EMG) pattern-recognition based control strategies for multifunctional myoelectric prosthesis systems have been studied commonly in a controlled laboratory setting. Before these myoelectric prosthesis systems are clinically viable, it will be necessary to assess the effect of some disparities between the ideal laboratory setting and practical use on the control performance. One important obstacle is the impact of arm position variation that causes the changes of EMG pattern when performing identical motions in different arm positions. This study aimed to investigate the impacts of arm position variation on EMG pattern-recognition based motion classification in upper-limb amputees and the solutions for reducing these impacts. Methods: With five unilateral transradial (TR) amputees, the EMG signals and tri-axial accelerometer mechanomyography (ACC-MMG) signals were simultaneously collected from both amputated and intact arms when performing six classes of arm and hand movements in each of five arm positions that were considered in the study. The effect of the arm position changes was estimated in terms of motion classification error and compared between amputated and intact arms. Then the performance of three proposed methods in attenuating the impact of arm positions was evaluated. Results: With EMG signals, the average intra-position and inter-position classification errors across all five arm positions and five subjects were around 7.3% and 29.9% from amputated arms, respectively, about 1.0% and 10% low in comparison with those from intact arms. While ACC-MMG signals could yield a similar intra-position classification error (9.9%) as EMG, they had much higher inter-position classification error with an average value of 81.1% over the arm positions and the subjects. When the EMG data from all five arm positions were involved in the training set, the average classification error reached a value of around 10.8% for amputated arms. Using a two-stage cascade classifier, the average classification error was around 9.0% over all five arm positions. Reducing ACC-MMG channels from 8 to 2 only increased the average position classification error across all five arm positions from 0.7% to 1.0% in amputated arms. Conclusions: The performance of EMG pattern-recognition based method in classifying movements strongly depends on arm positions. This dependency is a little stronger in intact arm than in amputated arm, which suggests that the investigations associated with practical use of a myoelectric prosthesis should use the limb amputees as subjects instead of using able-body subjects. The two-stage cascade classifier mode with ACC-MMG for limb position identification and EMG for limb motion classification may be a promising way to reduce the effect of limb position variation on classification performance.

The missing data in incomplete pattern can have different estimations, and the classification result of pattern with different estimations may be quite distinct. Such uncertainty (ambiguity) of classification is mainly caused by the loss of information in missing data. A new prototype-based credal classification (PCC) method is proposed to classify incomplete patterns using belief functions. The class prototypes obtained by the training data are respectively used to estimate the missing values. Typically, in a c-class problem, one has to deal with c prototypes which yields c estimations. The different edited patterns based on each possible estimation are then classified by a standard classifier and one can get c classification results for an incomplete pattern. Because all these classification results are potentially admissible, they are fused altogether to obtain the credal classification of the incomplete pattern. A new credal combination method is introduced for solving the classification problem, and it is able to characterize the inherent uncertainty due to the possible conflicting results delivered by the different estimations of missing data. The incomplete patterns that are hard to correctly classify will be reasonably committed to some proper meta-classes by PCC method in order to reduce the misclassification rate. The use and potential of PCC method is illustrated through several experiments with artificial and real data sets.

There are no author-identified significant results in this report.

This paper designs an efficient two-class pattern classifier utilizing asynchronous cellular automata (ACAs). The two-state three-neighborhood one-dimensional ACAs that converge to fixed points from arbitrary seeds are used here for pattern classification. To design the classifier, we first identify a set of ACAs that always converge to fixed points from any seeds with following properties - (1) each ACA should have at least two but not huge number of fixed point attractors, and (2) the convergence time of these ACAs are not to be exponential. In order to address the first issue, we propose a graph, coined as fixed point graph of an ACA that facilitates in counting the fixed points. We further perform an experimental study to estimate the convergence time of ACAs, and find that there are some convergent ACAs which demand exponential convergence time. Finally, we find that there are 71 (out of 256) ACAs which can be effective candidates as pattern classifier. We use each of the candidate ACAs on some standard data sets, and observe the effectiveness of each ACAs as pattern classifier. It is observed that the proposed classifier is very competitive and performs reliably better than many standard existing algorithms.

This paper designs an efficient two-class pattern classifier utilizing asynchronous cellular automata (ACAs). The two-state three-neighborhood one-dimensional ACAs that converge to fixed points from arbitrary seeds are used here for pattern classification. To design the classifier, we first identify a set of ACAs that always converge to fixed points from any seeds with following properties - (1) each ACA should have at least two but not huge number of fixed point attractors, and (2) the convergence time of these ACAs are not to be exponential. In order to address the first issue, we propose a graph, coined as fixed point graph of an ACA that facilitates in counting the fixed points. We further perform an experimental study to estimate the convergence time of ACAs, and find that there are some convergent ACAs which demand exponential convergence time. Finally, we find that there are 71 (out of 256) ACAs which can be effective candidates as pattern classifier. We use each of the candidate ACAs on some standard data sets, and observe the effectiveness of each ACAs as pattern classifier. It is observed that the proposed classifier is very competitive and performs reliably better than many standard existing algorithms.

This paper designs an efficient two-class pattern classifier utilizing asynchronous cellular automata (ACAs). The two-state three-neighborhood one-dimensional ACAs that converge to fixed points from arbitrary seeds are used here for pattern classification. To design the classifier, we first identify a set of ACAs that always converge to fixed points from any seeds with following properties - (1) each ACA should have at least two but not huge number of fixed point attractors, and (2) the convergence time of these ACAs are not to be exponential. In order to address the first issue, we propose a graph, coined as fixed point graph of an ACA that facilitates in counting the fixed points. We further perform an experimental study to estimate the convergence time of ACAs, and find that there are some convergent ACAs which demand exponential convergence time. Finally, we find that there are 71 (out of 256) ACAs which can be effective candidates as pattern classifier. We use each of the candidate ACAs on some standard data sets, and observe the effectiveness of each ACAs as pattern classifier. It is observed that the proposed classifier is very competitive and performs reliably better than many standard existing algorithms.

This paper addresses an unconventional application of a production system to a problem involving belief specialization. The production system reduces a large quantity of low-level descriptions into just a few higher-level descriptions that encompass the problem space in a more tractable fashion. This classification process utilizes a set of descriptions generated by combining the component hierarchy of a physical system with the semantics of the terminology employed in its operation. The paper describes an application of this process in a program, constructed in C and CLIPS, that classifies signatures of electromechanical system configurations. The program compares two independent classifications, describing the actual and expected system configurations, in order to generate a set of contradictions between the two.

There are no author-identified significant results in this report.

There are no author-identified significant results in this report.

Portable electronic systems allow the analysis and monitoring of continuous time signals, such as human activity, integrating deep learning techniques with cloud computing, causing network traffic and high energy consumption. In addition, the use of algorithms based on neural networks are a very widespread solution in these applications, but they have a high computational cost, not suitable for edge devices. In this context, solutions are created that bring data analysis closer to the edge of the network, so in this paper models adapted to an edge device for the recognition of human activity are evaluated, considering characteristics such as inference time, memory, and precision. Two categories of models based on deep and convolutional neural networks are developed by implementing them in C language and comparing with the TensorFlow Lite platform. The results show that the implementations with libraries have a better accuracy result of 76% using principal component analysis inputs, obtaining an execution time of 9ms. Therefore, when evaluating the models, we must not only consider their accuracy but also the execution time and memory on the device.

Some purely chiral fractional quantum Hall states are described by symmetric or anti-symmetric polynomials of infinite variables. In this article, we review a systematic construction and classification of those fractional quantum Hall states and the corresponding polynomials of infinite variables, using the pattern-of-zeros approach. We discuss how to use patterns of zeros to label different fractional quantum Hall states and the corresponding polynomials. We also discuss how to calculate various universal properties (ie the quantum topological invariants) from the pattern of zeros.

In this study we describe the development of a ride assistance application which can be implemented on the widespread smart phones and tablet. The ride assistance application has a signal processing and pattern classification module which yield almost 100% recognition accuracy for real-time signal pattern classification. We introduce a novel framework to build a training dictionary with an overwhelming discriminating capacity which eliminates the need of human intervention spotting the pattern on the training samples. We verify the recognition accuracy of the proposed methodologies by providing the results of another study in which the hand posture and gestures are tracked and recognized for steering a robotic wheelchair.

In this paper we present some extensions to the k-means algorithm for vector quantization that permit its efficient use in image segmentation and pattern classification tasks. It is shown that by introducing state variables that correspond to certain statistics of the dynamic behavior of the algorithm, it is possible to find the representative centers of the lower dimensional manifolds that define the boundaries between classes, for clouds of multi- dimensional, multi-class data; this permits one, for example, to find class boundaries directly from sparse data (e.g., in image segmentation tasks) or to efficiently place centers for pattern classification (e.g., with local Gaussian classifiers). The same state variables can be used to define algorithms for determining adaptively the optimal number of centers for clouds of data with space-varying density. Some examples of the application of these extensions are also given. K-Means, Vector quantization, Classification, Clustering, Segmentation.

It is well known that for certain tasks, quantum computing outperforms classical computing. A growing number of contributions try to use this advantage in order to improve or extend classical machine learning algorithms by methods of quantum information theory. This paper gives a brief introduction into quantum machine learning using the example of pattern classification. We introduce a quantum pattern classification algorithm that draws on Trugenberger's proposal for measuring the Hamming distance on a quantum computer (CA Trugenberger, Phys Rev Let 87, 2001) and discuss its advantages using handwritten digit recognition as from the MNIST database.

Thesis (MS)?Naval Postgraduate School, 1964

One method for classifying natural fracture systems is by fracture genesis. This approach involves the physics of the formation process, and it has been used most frequently in attempts to predict subsurface fractures and petroleum reservoir productivity. This classification system can also be applied to larger fracture systems on any planetary surface. One problem in applying this classification system to planetary surfaces is that it was developed for ralatively small-scale fractures that would influence porosity, particularly as observed in a core sample. Planetary studies also require consideration of large-scale fractures. Nevertheless, this system offers some valuable perspectives on fracture systems of any size.

One method for classifying natural fracture systems is by fracture genesis. This approach involves the physics of the formation process, and it has been used most frequently in attempts to predict subsurface fractures and petroleum reservoir productivity. This classification system can also be applied to larger fracture systems on any planetary surface. One problem in applying this classification system to planetary surfaces is that it was developed for ralatively small-scale fractures that would influence porosity, particularly as observed in a core sample. Planetary studies also require consideration of large-scale fractures. Nevertheless, this system offers some valuable perspectives on fracture systems of any size.

Thesis advisor, Tri T. Ha

There are no author-identified significant results in this report.

Abstract: In this paper, a new approach for facial gender classification is presented. The human face serves as a knowledge base for useful demographic information such as gender, expression and age. We can easily identify the gender of the person, but it is difficult for the machine to recognize gender from the face image. The face is a complex three dimensional object and it is a challenging task for a machine to recognise gender due to a wide degree of variations in texture and shape of the face. The gender recognition has many … more Keywords: Face Gender, local directional pattern, Princiapl Coomponets Analysis , Local Binary Pattern Authors: Mr. N. K. Bansode, AIT Prof. Dr. P. K. Sinha, AIT Dates of Issue (DOI) Submission Date: Wed, 27. Apr. 2016 Review Date: Wed, 11. May. 2016 Publishing Date: Wed, 1. Jun. 2016 http://www.icgst.com/paper.aspx?pid=P1151618493

Based on API call sequences, semantic-aware and machine learning (ML) based malware classifiers can be built for malware detection or classification. Previous works concentrate on crafting and extracting various features from malware binaries, disassembled binaries or API calls via static or dynamic analysis and resorting to ML to build classifiers. However, they tend to involve too much feature engineering and fail to provide interpretability. We solve these two problems with the recent advances in deep learning: 1) RNN-based autoencoders (RNN-AEs) can automatically learn low-dimensional representation of a malware from its raw API call sequence. 2) Multiple decoders can be trained under different supervisions to give more information, other than the class or family label of a malware. Inspired by the works of document classification and automatic sentence summarization, each API call sequence can be regarded as a sentence. In this paper, we make the first attempt to build a multi-task malware learning model based on API call sequences. The model consists of two decoders, one for malware classification and one for $\emph{file access pattern}$ (FAP) generation given the API call sequence of a malware. We base our model on the general seq2seq framework. Experiments show that our model can give competitive classification results as well as insightful FAP information.

Electrocardiogram (ECG) reflects activity of the central of the blood circulatory system, i.e. the heart. An ECG signal can provide us with a great deal of information on the normal and pathological physiology of heart activity. Thus, ECG is an important non-invasive clinical tool for the diagnosis of heart diseases.          According to the medical definition the most important information in the ECG signal is concentrated in the P wave, QRS complex and T wave. These data include positions and/or magnitudes of the QRS interval, PR interval, QT interval, ST interval, PR segment, and ST segment (see Fig. 1). Based on the above data, doctors can correctly diagnose human heart diseases. Therefore, analyzing the ECG signals of cardiac arrhythmia is very important for doctors to make correct clinical diagnoses. In order to perform ECG signals classification of the cardiac arrhythmia, the first important task is to determine an appropriate set of features. The feature selection method which chooses the best features from original features to have the maximum recognition rate, simplify classified computation and comprehend the causal relation of classified question. Signal Processing   is undoubtedly the best real time implementation of a specific problem. Wavelet Transform is a very powerful technique for feature extraction and can be used along with neural network structures to build computationally efficient models for diagnosis of Biosignals (ECG in this case). This work utilizes the above techniques for diagnosis of an ECG signal by determining its nature as well as exploring the possibility for real-time implementation of the above model. Daubechies wavelet transform and multi-layered perceptron are the computational techniques used for the realization of the above model. The ECG signals were obtained from the MIT-BIH arrhythmia database and are used for the identification of four different types of arrhythmias. The identification was implemented real-time in SIMULINK, to simulate the detection model under test condition and verify its workability.

Pattern Classification

This article is from NeuroImage : Clinical , volume 3 . Abstract Standard univariate analyses of brain imaging data have revealed a host of structural and functional brain alterations in schizophrenia. However, these analyses typically involve examining each voxel separately and making inferences at group-level, thus limiting clinical translation of their findings. Taking into account the fact that brain alterations in schizophrenia expand over a widely distributed network of brain regions, univariate analysis methods may not be the most suited choice for imaging data analysis. To address these limitations, the neuroimaging community has turned to machine learning methods both because of their ability to examine voxels jointly and their potential for making inferences at a single-subject level. This article provides a critical overview of the current and foreseeable applications of machine learning, in identifying imaging-based biomarkers that could be used for the diagnosis, early detection and treatment response of schizophrenia, and could, thus, be of high clinical relevance. We discuss promising future research directions and the main difficulties facing machine learning researchers as far as their potential translation into clinical practice is concerned.

Point patterns are sets or multi-sets of unordered elements that can be found in numerous data sources. However, in data analysis tasks such as classification and novelty detection, appropriate statistical models for point pattern data have not received much attention. This paper proposes the modelling of point pattern data via random finite sets (RFS). In particular, we propose appropriate likelihood functions, and a maximum likelihood estimator for learning a tractable family of RFS models. In novelty detection, we propose novel ranking functions based on RFS models, which substantially improve performance.

Point patterns are sets or multi-sets of unordered elements that can be found in numerous data sources. However, in data analysis tasks such as classification and novelty detection, appropriate statistical models for point pattern data have not received much attention. This paper proposes the modelling of point pattern data via random finite sets (RFS). In particular, we propose appropriate likelihood functions, and a maximum likelihood estimator for learning a tractable family of RFS models. In novelty detection, we propose novel ranking functions based on RFS models, which substantially improve performance.

The author has identified the following significant results. The sand beach was separated from sea water in each of four bands, if the beach had a width of 100 m or more. Density ranges of the sea for CCT counts were determined as 0-3 for band 7, 0-16 for band 6, 0-25 for band 5, and 0-27 for band 4.

Preregistration of Hypothesis in the CoScience Project.

We propose a technique for pattern classification in symbolic streams via selective erasure of observed symbols, in cases where the patterns of interest are represented as Probabilistic Finite State Automata (PFSA). We define an additive abelian group for a slightly restricted subset of probabilistic finite state automata (PFSA), and the group sum is used to formulate pattern-specific semantic annihilators. The annihilators attempt to identify pre-specified patterns via removal of essentially all inter-symbol correlations from observed sequences, thereby turning them into symbolic white noise. Thus a perfect annihilation corresponds to a perfect pattern match. This approach of classification via information annihilation is shown to be strictly advantageous, with theoretical guarantees, for a large class of PFSA models. The results are supported by simulation experiments.

Searchers and scientists have been studying neural networks for many years hoping to achieve human-like performance in the fields of speech and pattern recognition and classification. In this study, we are first going to make an introduction to the field of artificial neural networks, then we are going to describe some of the neural nets used in the pattern recognition and classification. A computer simulation program from an algorithmic approach for each one of these networks will be constructed and used to implement the operation of the net. Its ability will be demonstrated in differentiating between different patterns and even correcting a noisy pattern and recognizing it. The Hopfield network, the Hamming network and the Carpenter / Grossberg network will be individually utilized in developing an algorithm for pattern recognition and classification. The maximum-likelihood sequence estimation function will be mapped onto a neural network structure. The application of this structure computations for data detection in digital communications receivers will be described. A computer simulation program will be constructed and used to show that neural networks offer attractive implementation alternatives for MLSE.

The use of patterns in predictive models is a topic that has received a lot of attention in recent years. Pattern mining can help to obtain models for structured domains, such as graphs and sequences, and has been proposed as a means to obtain more accurate and more interpretable models. Despite the large amount of publications devoted to this topic, we believe however that an overview of what has been accomplished in this area is missing. This paper presents our perspective on this evolving area. We identify the principles of pattern mining that are important when mining patterns for models and provide an overview of pattern-based classification methods. We categorize these methods along the following dimensions: (1) whether they post-process a pre-computed set of patterns or iteratively execute pattern mining algorithms; (2) whether they select patterns model-independently or whether the pattern selection is guided by a model. We summarize the results that have been obtained for each of these methods.

The purpose of this study is to introduce a probabilistic approach to classify and diagnose erroneous rules of operation resulting from a variety of misconceptions ('bugs') in a procedural domain of arithmetic. The model contrasts the deterministic approach which has commonly been used in the field of artificial intelligence and shows an advantage in treating the variability of errors in responses. Item response theory (IRT) turned out to be a useful model in integrating the theory of cognitive processes with educational practice. In this paper, erroneous rules of operation in signed-number subtraction problems are represented as points in a geometric space by utilizing IRT. We named this space 'rule space.' This approach seems promising in assessing the state of knowledge as reflected by erroneous rules and in utilizing the information obtained from behaviors of bugs into educational evaluation.

This article is from Healthcare Informatics Research , volume 16 . Abstract Objectives: This study sought to find answers to the following questions: 1) Can we predict whether a patient will revisit a healthcare center? 2) Can we anticipate diseases of patients who revisit the center? Methods: For the first question, we applied 5 classification algorithms (decision tree, artificial neural network, logistic regression, Bayesian networks, and Naïve Bayes) and the stacking-bagging method for building classification models. To solve the second question, we performed sequential pattern analysis. Results: We determined: 1) In general, the most influential variables which impact whether a patient of a public healthcare center will revisit it or not are personal burden, insurance bill, period of prescription, age, systolic pressure, name of disease, and postal code. 2) The best plain classification model is dependent on the dataset. 3) Based on average of classification accuracy, the proposed stacking-bagging method outperformed all traditional classification models and our sequential pattern analysis revealed 16 sequential patterns. Conclusions: Classification models and sequential patterns can help public healthcare centers plan and implement healthcare service programs and businesses that are more appropriate to local residents, encouraging them to revisit public health centers.

The feasibility of using charge transfer devices in the classification of multispectral imagery was investigated by evaluating particular devices to determine their suitability in matrix multiplication subsystem of a pattern classifier and by designing a protype of such a system. Particular attention was given to analog-analog correlator devices which consist of two tapped delay lines, chip multipliers, and a summed output. The design for the classifier and a printed circuit layout for the analog boards were completed and the boards were fabricated. A test j:g for the board was built and checkout was begun.

The feasibility of using charge transfer devices in the classification of multispectral imagery was investigated by evaluating particular devices to determine their suitability in matrix multiplication subsystem of a pattern classifier and by designing a protype of such a system. Particular attention was given to analog-analog correlator devices which consist of two tapped delay lines, chip multipliers, and a summed output. The design for the classifier and a printed circuit layout for the analog boards were completed and the boards were fabricated. A test j:g for the board was built and checkout was begun.

http://uf.catalog.fcla.edu/uf.jsp?st=UF000687925&ix=nu&I=0&V=D

Significant progress has been made in the classification of surface conditions (land uses) with computer-implemented techniques based on the use of ERTS digital data and pattern recognition software. The supervised technique presently used at the NASA Earth Resources Laboratory is based on maximum likelihood ratioing with a digital table look-up approach to classification. After classification, colors are assigned to the various surface conditions (land uses) classified, and the color-coded classification is film recorded on either positive or negative 9 1/2 in. film at the scale desired. Prints of the film strips are then mosaicked and photographed to produce a land use map in the format desired. Computer extraction of statistical information is performed to show the extent of each surface condition (land use) within any given land unit that can be identified in the image. Evaluations of the product indicate that classification accuracy is well within the limits for use by land resource managers and administrators. Classifications performed with digital data acquired during different seasons indicate that the combination of two or more classifications offer even better accuracy.

Human beings judge patterns (such as images) by complex mental processes, some of which may not be known, while computing machines extract features. By representing the human judgements with simple measurements and reducing them and the machine extracted features to a common metric space and fitting them by regression, the judgements of human experts rendered on a sample of patterns may be imposed on a pattern population to provide automatic classification.

Deep neural networks have been exhibiting splendid accuracies in many of visual pattern classification problems. Many of the state-of-the-art methods employ a technique known as data augmentation at the training stage. This paper addresses an issue of decision rule for classifiers trained with augmented data. Our method is named as APAC: the Augmented PAttern Classification, which is a way of classification using the optimal decision rule for augmented data learning. Discussion of methods of data augmentation is not our primary focus. We show clear evidences that APAC gives far better generalization performance than the traditional way of class prediction in several experiments. Our convolutional neural network model with APAC achieved a state-of-the-art accuracy on the MNIST dataset among non-ensemble classifiers. Even our multilayer perceptron model beats some of the convolutional models with recently invented stochastic regularization techniques on the CIFAR-10 dataset.

Deep neural networks have been exhibiting splendid accuracies in many of visual pattern classification problems. Many of the state-of-the-art methods employ a technique known as data augmentation at the training stage. This paper addresses an issue of decision rule for classifiers trained with augmented data. Our method is named as APAC: the Augmented PAttern Classification, which is a way of classification using the optimal decision rule for augmented data learning. Discussion of methods of data augmentation is not our primary focus. We show clear evidences that APAC gives far better generalization performance than the traditional way of class prediction in several experiments. Our convolutional neural network model with APAC achieved a state-of-the-art accuracy on the MNIST dataset among non-ensemble classifiers. Even our multilayer perceptron model beats some of the convolutional models with recently invented stochastic regularization techniques on the CIFAR-10 dataset.

A Weblogs contains the history of User Navigation Pattern while user accessing the websites. The user navigation pattern can be analyzed based on the previous user navigation that is stored in weblog. The weblog comprises of various entries like IP address, status code and number of bytes transferred, categories and time stamp. The user interest can be classified based on categories and attributes and it is helpful in identifying user behavior. The aim of the research is to identifying the interested user behavior and not interested user behavior based on classification. The process of identifying user interest, it consists of Modified Span Algorithm and Personalization Algorithm based on the classification algorithm user prediction can be analyzed. The research work explores to analyze user prediction behavior based on user personalization that is captured from weblogs.

A Weblogs contains the history of User Navigation Pattern while user accessing the websites. The user navigation pattern can be analyzed based on the previous user navigation that is stored in weblog. The weblog comprises of various entries like IP address, status code and number of bytes transferred, categories and time stamp. The user interest can be classified based on categories and attributes and it is helpful in identifying user behavior. The aim of the research is to identifying the interested user behavior and not interested user behavior based on classification. The process of identifying user interest, it consists of Modified Span Algorithm and Personalization Algorithm based on the classification algorithm user prediction can be analyzed. The research work explores to analyze user prediction behavior based on user personalization that is captured from weblogs.

A Weblogs contains the history of User Navigation Pattern while user accessing the websites. The user navigation pattern can be analyzed based on the previous user navigation that is stored in weblog. The weblog comprises of various entries like IP address, status code and number of bytes transferred, categories and time stamp. The user interest can be classified based on categories and attributes and it is helpful in identifying user behavior. The aim of the research is to identifying the interested user behavior and not interested user behavior based on classification. The process of identifying user interest, it consists of Modified Span Algorithm and Personalization Algorithm based on the classification algorithm user prediction can be analyzed. The research work explores to analyze user prediction behavior based on user personalization that is captured from weblogs.

This research introduces the appropriate input pattern of Fuzzy Logic design for fault type classification of Single Line to Ground Fault at distribution network. The proposed design is solely using Fuzzy Logic as the research technique with input data from PSCAD simulation. PSCAD software simulate the circuit configuration for fault disturbance at the distribution network. The research technique was applied with multiples input values of voltage and current that extracted from the PSCAD simulation. This research testifies the output result by using different fault resistance values; 0.01Ω, 10Ω, 30Ω, 50Ω and 70Ω. Voltage sag and current swell of phase a, b and c that were obtained from the PSCAD simulation have been used as the input variables for Fuzzy Logic design. The acquired results that represented in average accuracy shown that voltage sag and current swell can draw a satisfying accuracy in classifying the fault type. 

This research introduces the appropriate input pattern of Fuzzy Logic design for fault type classification of Single Line to Ground Fault at distribution network. The proposed design is solely using Fuzzy Logic as the research technique with input data from PSCAD simulation. PSCAD software simulate the circuit configuration for fault disturbance at the distribution network. The research technique was applied with multiples input values of voltage and current that extracted from the PSCAD simulation. This research testifies the output result by using different fault resistance values; 0.01Ω, 10Ω, 30Ω, 50Ω and 70Ω. Voltage sag and current swell of phase a, b and c that were obtained from the PSCAD simulation have been used as the input variables for Fuzzy Logic design. The acquired results that represented in average accuracy shown that voltage sag and current swell can draw a satisfying accuracy in classifying the fault type. 

A knowledge-based interactive problem solving environment called KIPSE1 is presented. The KIPSE1 is a system built on a commercial expert system shell, the KEE system. This environment gives user capability to carry out exploratory data analysis and pattern classification tasks. A good solution often consists of a sequence of steps with a set of methods used at each step. In KIPSE1, solution is represented in the form of a decision tree and each node of the solution tree represents a partial solution to the problem. Many methodologies are provided at each node to the user such that the user can interactively select the method and data sets to test and subsequently examine the results. Otherwise, users are allowed to make decisions at various stages of problem solving to subdivide the problem into smaller subproblems such that a large problem can be handled and a better solution can be found.

A knowledge-based interactive problem solving environment called KIPSE1 is presented. The KIPSE1 is a system built on a commercial expert system shell, the KEE system. This environment gives user capability to carry out exploratory data analysis and pattern classification tasks. A good solution often consists of a sequence of steps with a set of methods used at each step. In KIPSE1, solution is represented in the form of a decision tree and each node of the solution tree represents a partial solution to the problem. Many methodologies are provided at each node to the user such that the user can interactively select the method and data sets to test and subsequently examine the results. Otherwise, users are allowed to make decisions at various stages of problem solving to subdivide the problem into smaller subproblems such that a large problem can be handled and a better solution can be found.

A knowledge-based interactive problem solving environment called KIPSE1 is presented. The KIPSE1 is a system built on a commercial expert system shell, the KEE system. This environment gives user capability to carry out exploratory data analysis and pattern classification tasks. A good solution often consists of a sequence of steps with a set of methods used at each step. In KIPSE1, solution is represented in the form of a decision tree and each node of the solution tree represents a partial solution to the problem. Many methodologies are provided at each node to the user such that the user can interactively select the method and data sets to test and subsequently examine the results. Otherwise, users are allowed to make decisions at various stages of problem solving to subdivide the problem into smaller subproblems such that a large problem can be handled and a better solution can be found.

In this paper, we present a decision level fused local Morphological Pattern Spectrum(PS) and Local Binary Pattern (LBP) approach for an efficient shape representation and classification. This method makes use of Earth Movers Distance(EMD) as the measure in feature matching and shape retrieval process. The proposed approach has three major phases : Feature Extraction, Construction of hybrid spectrum knowledge base and Classification. In the first phase, feature extraction of the shape is done using pattern spectrum and local binary pattern method. In the second phase, the histograms of both pattern spectrum and local binary pattern are fused and stored in the knowledge base. In the third phase, the comparison and matching of the features, which are represented in the form of histograms, is done using Earth Movers Distance(EMD) as metric. The top-n shapes are retrieved for each query shape. The accuracy is tested by means of standard Bulls eye score method. The experiments are conducted on publicly available shape datasets like Kimia-99, Kimia-216 and MPEG-7. The comparative study is also provided with the well known approaches to exhibit the retrieval accuracy of the proposed approach.