Collaborative Use of Features in a Distributed System for the Organization of Music Collections

Author(s):  
Ingo Mierswa

Today, large audio collections are stored at computers. Their organization can be supported by machine learning. This demands a more abstract representation than is the time series of audio values. We have developed a unifying framework which decomposes the complex extraction methods into their building blocks. This allows us to move beyond the manual composition of feature extraction methods. Several of the well-known features as well as some new ones have been composed automatically by a genetic learning algorithm. While this has delivered good classifications it needs long training times. Hence, we additionally follow a meta-learning approach. We have developed a method of feature transfer which exploits the similarity of learning tasks to retrieve similar feature extractions. This method achieves almost optimal accuracies while it is very efficient. Nemoz, an intelligent media management system, incorporates adaptive feature extraction and feature transfer which allows for personalized services in peer-to-peer settings.

2021 ◽  
Vol 6 (22) ◽  
pp. 51-59
Author(s):  
Mustazzihim Suhaidi ◽  
Rabiah Abdul Kadir ◽  
Sabrina Tiun

Extracting features from input data is vital for successful classification and machine learning tasks. Classification is the process of declaring an object into one of the predefined categories. Many different feature selection and feature extraction methods exist, and they are being widely used. Feature extraction, obviously, is a transformation of large input data into a low dimensional feature vector, which is an input to classification or a machine learning algorithm. The task of feature extraction has major challenges, which will be discussed in this paper. The challenge is to learn and extract knowledge from text datasets to make correct decisions. The objective of this paper is to give an overview of methods used in feature extraction for various applications, with a dataset containing a collection of texts taken from social media.


2016 ◽  
Author(s):  
Xiaoqian Liu ◽  
Tingshao Zhu

Due to the rapid development of information technology, Internet has become part of everyday life gradually. People would like to communicate with friends to share their opinions on social networks. The diverse social network behavior is an ideal users' personality traits reflection. Existing behavior analysis methods for personality prediction mostly extract behavior attributes with heuristic. Although they work fairly well, but it is hard to extend and maintain. In this paper, for personality prediction, we utilize deep learning algorithm to build feature learning model, which could unsupervised extract Linguistic Representation Feature Vector (LRFV) from text published on Sina Micro-blog actively. Compared with other feature extraction methods, LRFV, as an abstract representation of Micro-blog content, could describe use's semantic information more objectively and comprehensively. In the experiments, the personality prediction model is built using linear regression algorithm, and different attributes obtained through different feature extraction methods are taken as input of prediction model respectively. The results show that LRFV performs more excellently in micro-blog behavior description and improve the performance of personality prediction model.


2016 ◽  
Author(s):  
Xiaoqian Liu ◽  
Tingshao Zhu

Due to the rapid development of information technology, Internet has become part of everyday life gradually. People would like to communicate with friends to share their opinions on social networks. The diverse social network behavior is an ideal users' personality traits reflection. Existing behavior analysis methods for personality prediction mostly extract behavior attributes with heuristic. Although they work fairly well, but it is hard to extend and maintain. In this paper, for personality prediction, we utilize deep learning algorithm to build feature learning model, which could unsupervised extract Linguistic Representation Feature Vector (LRFV) from text published on Sina Micro-blog actively. Compared with other feature extraction methods, LRFV, as an abstract representation of Micro-blog content, could describe use's semantic information more objectively and comprehensively. In the experiments, the personality prediction model is built using linear regression algorithm, and different attributes obtained through different feature extraction methods are taken as input of prediction model respectively. The results show that LRFV performs more excellently in micro-blog behavior description and improve the performance of personality prediction model.


Author(s):  
Qiao Sun ◽  
Xiaolei Li ◽  
Baoyun Xu

Abstract This paper describes the application of neural networks to gearbox fault diagnosis. In order to increase learning speed of BP network, a modified learning algorithm was presented. Considering of the difficulty of choosing neural networks’ architecture, genetic algorithm was employed. The discussion of the effect of hidden layer nodes shows that with the increase of the number of nodes, the learning speed increase also yet result in poor generalization ability. The test of fault tolerance ability tells that neural networks have ‘bench type’ tolerance ability. This ensures that when signals were contaminated by noise or feature extraction methods were not effective, the result can still be acceptable. To test the performance of the application of neural networks on gearbox fault diagnosis, experiments of single fault and multi-faults were both implemented and diagnosed by neural networks. The results were satisfied.


2020 ◽  
Vol 2020 ◽  
pp. 1-11 ◽  
Author(s):  
Jingbo Gai ◽  
Junxian Shen ◽  
He Wang ◽  
Yifan Hu

Aiming at the problems of poor self-adaptive ability in traditional feature extraction methods and weak generalization ability in single classifier under big data, an internal parameter-optimized Deep Belief Network (DBN) method based on grasshopper optimization algorithm (GOA) is proposed. First, the minimum Root Mean Square Error (RMSE) in the network training is taken as the fitness function, in which GOA is used to search for the optimal parameter combination of DBN. After that the learning rate and the number of batch learning in DBN which have great influence on the training error would be properly selected. At the same time, the optimal structure distribution of DBN is given through comparison. Then, FFT and linear normalization are introduced to process the original vibration signal of the gearbox, preprocess the data from multiple sensors and construct the input samples for DBN. Finally, combining with deep learning featured by powerful self-adaptive feature extraction and nonlinear mapping capabilities, the obtained samples are input into DBN for training, and the fault diagnosis model for gearbox based on DBN would be established. After several tests with the remaining samples, the diagnosis rate of the model could reach over 99.5%, which is far better than the traditional fault diagnosis method based on feature extraction and pattern recognition. The experimental results show that this method could effectively improve the self-adaptive feature extraction ability of the model as well as its accuracy of fault diagnosis, which has better generalization performance.


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Bing Lu ◽  
Haipeng Lu ◽  
Guohua Zhou ◽  
Xinchun Yin ◽  
Xiaoqing Gu ◽  
...  

Mobile edge computing (MEC) has the ability of pattern recognition and intelligent processing of real-time data. Electroencephalogram (EEG) is a very important tool in the study of epilepsy. It provides rich information that can not be provided by other physiological methods. In the automatic classification of EEG signals by intelligent algorithms, feature extraction and the establishment of classifiers are both very important steps. Different feature extraction methods, such as time domain, frequency domain, and nonlinear dynamic feature methods, contain independent and diverse specific information. Using multiple forms of features at the same time can improve the accuracy of epilepsy recognition. In this paper, we apply metric learning to epileptic EEG signal recognition. Inspired by the equidistance constrained metric learning algorithm, we propose multifeature metric learning based on enhanced equidistance embedding (MMLE3) for EEG recognition of epilepsy. The MMLE3 algorithm makes use of various forms of EEG features, and the feature weights are adaptively weighted. It is a big advantage that the feature weight vector can be adjusted adaptively, without manual adjustment. The MMLE3 algorithm maximizes the distance between the samples constrained by the cannot-link, and the samples of different classes are transformed into equidistant; meanwhile, MMLE3 minimizes the distance between the data constrained by the must-link, and the samples of the same class are compressed to one point. Under the premise that the various feature classification tasks are consistent, MMLE3 can fully extract the associated and complementary information hidden between the features. The experimental results on the CHB-MIT dataset verify that the MMLE3 algorithm has good generalization performance.


2014 ◽  
Vol 51 (1) ◽  
pp. 57-73 ◽  
Author(s):  
Karol Deręgowski ◽  
Mirosław Krzyśko

SUMMARY Kernel principal components (KPC) and kernel discriminant coordinates (KDC), which are the extensions of principal components and discriminant coordinates, respectively, from a linear domain to a nonlinear domain via the kernel trick, are two very popular nonlinear feature extraction methods. The kernel discriminant coordinates space has proven to be a very powerful space for pattern recognition. However, further study shows that there are still drawbacks in this method. To improve the performance of pattern recognition, we propose a new learning algorithm combining the advantages of KPC and KDC


Author(s):  
Kunal Parikh ◽  
Tanvi Makadia ◽  
Harshil Patel

Dengue is unquestionably one of the biggest health concerns in India and for many other developing countries. Unfortunately, many people have lost their lives because of it. Every year, approximately 390 million dengue infections occur around the world among which 500,000 people are seriously infected and 25,000 people have died annually. Many factors could cause dengue such as temperature, humidity, precipitation, inadequate public health, and many others. In this paper, we are proposing a method to perform predictive analytics on dengue’s dataset using KNN: a machine-learning algorithm. This analysis would help in the prediction of future cases and we could save the lives of many.


2020 ◽  
Author(s):  
Vricha Chavan ◽  
​Jimit Shah ◽  
Mrugank Vora ◽  
Mrudula Vora ◽  
Shubhashini Verma

2021 ◽  
Vol 6 (1) ◽  
Author(s):  
Peter Morales ◽  
Rajmonda Sulo Caceres ◽  
Tina Eliassi-Rad

AbstractComplex networks are often either too large for full exploration, partially accessible, or partially observed. Downstream learning tasks on these incomplete networks can produce low quality results. In addition, reducing the incompleteness of the network can be costly and nontrivial. As a result, network discovery algorithms optimized for specific downstream learning tasks given resource collection constraints are of great interest. In this paper, we formulate the task-specific network discovery problem as a sequential decision-making problem. Our downstream task is selective harvesting, the optimal collection of vertices with a particular attribute. We propose a framework, called network actor critic (NAC), which learns a policy and notion of future reward in an offline setting via a deep reinforcement learning algorithm. The NAC paradigm utilizes a task-specific network embedding to reduce the state space complexity. A detailed comparative analysis of popular network embeddings is presented with respect to their role in supporting offline planning. Furthermore, a quantitative study is presented on various synthetic and real benchmarks using NAC and several baselines. We show that offline models of reward and network discovery policies lead to significantly improved performance when compared to competitive online discovery algorithms. Finally, we outline learning regimes where planning is critical in addressing sparse and changing reward signals.


Sign in / Sign up

Export Citation Format

Share Document