scholarly journals EEG correlation at a distance: A re-analysis of two studies using a machine learning approach

F1000Research ◽  
2019 ◽  
Vol 8 ◽  
pp. 43 ◽  
Author(s):  
Marco Bilucaglia ◽  
Luciano Pederzoli ◽  
William Giroldini ◽  
Elena Prati ◽  
Patrizio Tressoldi
Keyword(s):  
Machine Learning ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Eeg Activity ◽  
Linear Discriminant ◽  
Machine Learning Approach ◽  
Sensorial Stimulation ◽  
The Relationship ◽  
Electroencephalogram Eeg ◽  
Linear Discriminant Classifier

Background: In this paper, data from two studies relative to the relationship between the electroencephalogram (EEG) activities of two isolated and physically separated subjects were re-analyzed using machine-learning algorithms. The first dataset comprises the data of 25 pairs of participants where one member of each pair was stimulated with a visual and an auditory 500 Hz signals of 1 second duration. The second dataset consisted of the data of 20 pairs of participants where one member of each pair received visual and auditory stimulation lasting 1 second duration with on-off modulation at 10, 12, and 14 Hz. Methods and Results: Applying a ‘linear discriminant classifier’ to the first dataset, it was possible to correctly classify 50.74% of the EEG activity of non-stimulated participants, correlated to the remote sensorial stimulation of the distant partner. In the second dataset, the percentage of correctly classified EEG activity in the non-stimulated partners was 51.17%, 50.45% and 51.91%, respectively, for the 10, 12, and 14 Hz stimulations, with respect the condition of no stimulation in the distant partner. Conclusions: The analysis of EEG activity using machine-learning algorithms has produced advances in the study of the connection between the EEG activities of the stimulated partner and the isolated distant partner, opening new insight into the possibility to devise practical application for non-conventional “mental telecommunications” between physically and sensorially separated participants.

scholarly journals EEG correlation at a distance: A re-analysis of two studies using a machine learning approach

F1000Research ◽  
2019 ◽  
Vol 8 ◽  
pp. 43
Author(s):  
Marco Bilucaglia ◽  
Luciano Pederzoli ◽  
William Giroldini ◽  
Elena Prati ◽  
Patrizio Tressoldi
Keyword(s):  
Machine Learning ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Eeg Activity ◽  
Linear Discriminant ◽  
Machine Learning Approach ◽  
Sensorial Stimulation ◽  
The Relationship ◽  
Electroencephalogram Eeg ◽  
Linear Discriminant Classifier

Background: In this paper, data from two studies relative to the relationship between the electroencephalogram (EEG) activities of two isolated and physically separated subjects were re-analyzed using machine-learning algorithms. The first dataset comprises the data of 25 pairs of participants where one member of each pair was stimulated with a visual and an auditory 500 Hz signals of 1 second duration. The second dataset consisted of the data of 20 pairs of participants where one member of each pair received visual and auditory stimulation lasting 1 second duration with on-off modulation at 10, 12, and 14 Hz. Methods and Results: Applying a ‘linear discriminant classifier’ to the first dataset, it was possible to correctly classify 50.74% of the EEG activity of non-stimulated participants, correlated to the remote sensorial stimulation of the distant partner. In the second dataset, the percentage of correctly classified EEG activity in the non-stimulated partners was 51.17%, 50.45% and 51.91%, respectively, for the 10, 12, and 14 Hz stimulations, with respect the condition of no stimulation in the distant partner. Conclusions: The analysis of EEG activity using machine-learning algorithms has produced advances in the study of the connection between the EEG activities of the stimulated partner and the isolated distant partner, opening new insight into the possibility to devise practical application for non-conventional “mental telecommunications” between physically and sensorially separated participants.

scholarly journals Algorithmic and human prediction of success in human collaboration from visual features

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Martin Saveski ◽  
Edmond Awad ◽  
Iyad Rahwan ◽  
Manuel Cebrian
Keyword(s):  
Machine Learning ◽  
Visual Cues ◽  
Success Factors ◽  
Group Performance ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Adventure Game ◽  
Group Success ◽  
The Relationship ◽  
Better Than

AbstractAs groups are increasingly taking over individual experts in many tasks, it is ever more important to understand the determinants of group success. In this paper, we study the patterns of group success in Escape The Room, a physical adventure game in which a group is tasked with escaping a maze by collectively solving a series of puzzles. We investigate (1) the characteristics of successful groups, and (2) how accurately humans and machines can spot them from a group photo. The relationship between these two questions is based on the hypothesis that the characteristics of successful groups are encoded by features that can be spotted in their photo. We analyze >43K group photos (one photo per group) taken after groups have completed the game—from which all explicit performance-signaling information has been removed. First, we find that groups that are larger, older and more gender but less age diverse are significantly more likely to escape. Second, we compare humans and off-the-shelf machine learning algorithms at predicting whether a group escaped or not based on the completion photo. We find that individual guesses by humans achieve 58.3% accuracy, better than random, but worse than machines which display 71.6% accuracy. When humans are trained to guess by observing only four labeled photos, their accuracy increases to 64%. However, training humans on more labeled examples (eight or twelve) leads to a slight, but statistically insignificant improvement in accuracy (67.4%). Humans in the best training condition perform on par with two, but worse than three out of the five machine learning algorithms we evaluated. Our work illustrates the potentials and the limitations of machine learning systems in evaluating group performance and identifying success factors based on sparse visual cues.

scholarly journals A Survey on Machine Learning Algorithms for Vision State Classification and Prediction Through Electroencephalogram (EEG) Signal

2020 ◽  
pp. 426-429
Author(s):  
Devipriya A ◽  
Brindha D ◽  
Kousalya A
Keyword(s):  
Machine Learning ◽  
Learning Algorithms ◽  
Problem Area ◽  
Machine Learning Algorithms ◽  
Eeg Signal ◽  
Ensemble Machine Learning ◽  
State Classification ◽  
Machine Learning Model ◽  
Knn Classification ◽  
Electroencephalogram Eeg

Eye state ID is a sort of basic time-arrangement grouping issue in which it is additionally a problem area in the late exploration. Electroencephalography (EEG) is broadly utilized in a vision state in order to recognize people perception form. Past examination was approved possibility of AI & measurable methodologies of EEG vision state arrangement. This research means to propose novel methodology for EEG vision state distinguishing proof utilizing Gradual Characteristic Learning (GCL) in light of neural organizations. GCL is a novel AI methodology which bit by bit imports and prepares includes individually. Past examinations have confirmed that such a methodology is appropriate for settling various example acknowledgment issues. Nonetheless, in these past works, little examination on GCL zeroed in its application to temporal-arrangement issues. Thusly, it is as yet unclear if GCL will be utilized for adapting the temporal-arrangement issues like EEG vision state characterization. Trial brings about this examination shows that, with appropriate element extraction and highlight requesting, GCL cannot just productively adapt to time-arrangement order issues, yet additionally display better grouping execution as far as characterization mistake rates in correlation with ordinary and some different methodologies. Vision state classification is performed and discussed with KNN classification and accuracy is enriched finally discussed the vision state classification with ensemble machine learning model.

PSIX-15 Assessment of machine learning algorithms for prediction of Aleutian disease in American mink

2021 ◽  
Vol 99 (Supplement_3) ◽  
pp. 264-265
Author(s):  
Duy Ngoc Do ◽  
Guoyu Hu ◽  
Younes Miar
Keyword(s):  
Machine Learning ◽  
Random Forest ◽  
Linear Models ◽  
American Mink ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Training Data ◽  
Enzyme Linked Immunosorbent Assay ◽  
Linear Discriminant ◽  
Machine Learning Classification

Abstract American mink (Neovison vison) is the major source of fur for the fur industries worldwide and Aleutian disease (AD) is causing severe financial losses to the mink industry. Different methods have been used to diagnose the AD in mink, but the combination of several methods can be the most appropriate approach for the selection of AD resilient mink. Iodine agglutination test (IAT) and counterimmunoelectrophoresis (CIEP) methods are commonly employed in test-and-remove strategy; meanwhile, enzyme-linked immunosorbent assay (ELISA) and packed-cell volume (PCV) methods are complementary. However, using multiple methods are expensive; and therefore, hindering the corrected use of AD tests in selection. This research presented the assessments of the AD classification based on machine learning algorithms. The Aleutian disease was tested on 1,830 individuals using these tests in an AD positive mink farm (Canadian Centre for Fur Animal Research, NS, Canada). The accuracy of classification for CIEP was evaluated based on the sex information, and IAT, ELISA and PCV test results implemented in seven machine learning classification algorithms (Random Forest, Artificial Neural Networks, C50Tree, Naive Bayes, Generalized Linear Models, Boost, and Linear Discriminant Analysis) using the Caret package in R. The accuracy of prediction varied among the methods. Overall, the Random Forest was the best-performing algorithm for the current dataset with an accuracy of 0.89 in the training data and 0.94 in the testing data. Our work demonstrated the utility and relative ease of using machine learning algorithms to assess the CIEP information, and consequently reducing the cost of AD tests. However, further works require the inclusion of production and reproduction information in the models and extension of phenotypic collection to increase the accuracy of current methods.

Introduction and Implementation of Machine Learning Algorithms in R

2019 ◽  
pp. 126-147
Author(s):  
S. R. Mani Sekhar ◽  
G. M. Siddesh
Keyword(s):  
Machine Learning ◽  
Neural Networks ◽  
Support Vector Machine ◽  
Discriminant Analysis ◽  
Computer Science ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Linear Discriminant ◽  
The Given

Machine learning is one of the important areas in the field of computer science. It helps to provide an optimized solution for the real-world problems by using past knowledge or previous experience data. There are different types of machine learning algorithms present in computer science. This chapter provides the overview of some selected machine learning algorithms such as linear regression, linear discriminant analysis, support vector machine, naive Bayes classifier, neural networks, and decision trees. Each of these methods is illustrated in detail with an example and R code, which in turn assists the reader to generate their own solutions for the given problems.

scholarly journals Analysis of Machine Learning-Based Assessment for Elbow Spasticity Using Inertial Sensors

Sensors ◽  
2020 ◽  
Vol 20 (6) ◽  
pp. 1622 ◽  
Author(s):  
Jung-Yeon Kim ◽  
Geunsu Park ◽  
Seong-A Lee ◽  
Yunyoung Nam
Keyword(s):  
Machine Learning ◽  
Inertial Sensors ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Lower Limbs ◽  
Support Vector ◽  
Multilayer Perceptrons ◽  
Test Machine ◽  
Linear Discriminant ◽  
Passive Stretch

Spasticity is a frequently observed symptom in patients with neurological impairments. Spastic movements of their upper and lower limbs are periodically measured to evaluate functional outcomes of physical rehabilitation, and they are quantified by clinical outcome measures such as the modified Ashworth scale (MAS). This study proposes a method to determine the severity of elbow spasticity, by analyzing the acceleration and rotation attributes collected from the elbow of the affected side of patients and machine-learning algorithms to classify the degree of spastic movement; this approach is comparable to assigning an MAS score. We collected inertial data from participants using a wearable device incorporating inertial measurement units during a passive stretch test. Machine-learning algorithms—including decision tree, random forests (RFs), support vector machine, linear discriminant analysis, and multilayer perceptrons—were evaluated in combinations of two segmentation techniques and feature sets. A RF performed well, achieving up to 95.4% accuracy. This work not only successfully demonstrates how wearable technology and machine learning can be used to generate a clinically meaningful index but also offers rehabilitation patients an opportunity to monitor the degree of spasticity, even in nonhealthcare institutions where the help of clinical professionals is unavailable.

A Machine Learning Approach for One-Stop Learning

2008 ◽  
pp. 333-357 ◽  
Author(s):  
Marco A. Alvarez ◽  
SeungJin Lim
Keyword(s):  
Machine Learning ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Learning Approach ◽  
Internet Users ◽  
Machine Learning Approach ◽  
Supervised Learning Algorithms ◽  
One Stop ◽  
The Subject

Current search engines impose an overhead to motivated students and Internet users who employ the Web as a valuable resource for education. The user, searching for good educational materials for a technical subject, often spends extra time to filter irrelevant pages or ends up with commercial advertisements. It would be ideal if, given a technical subject by user who is educationally motivated, suitable materials with respect to the given subject are automatically identified by an affordable machine processing of the recommendation set returned by a search engine for the subject. In this scenario, the user can save a significant amount of time in filtering out less useful Web pages, and subsequently the user’s learning goal on the subject can be achieved more efficiently without clicking through numerous pages. This type of convenient learning is called One-Stop Learning (OSL). In this paper, the contributions made by Lim and Ko in (Lim and Ko, 2006) for OSL are redefined and modeled using machine learning algorithms. Four selected supervised learning algorithms: Support Vector Machine (SVM), AdaBoost, Naive Bayes and Neural Networks are evaluated using the same data used in (Lim and Ko, 2006). The results presented in this paper are promising, where the highest precision (98.9%) and overall accuracy (96.7%) obtained by using SVM is superior to the results presented by Lim and Ko. Furthermore, the machine learning approach presented here, demonstrates that the small set of features used to represent each Web page yields a good solution for the OSL problem.

scholarly journals Optimized Classification Predictions with a New Index Combining Machine Learning Algorithms

2018 ◽  
Vol 27 (03) ◽  
pp. 1850012 ◽  
Author(s):  
Androniki Tamvakis ◽  
Christos-Nikolaos Anagnostopoulos ◽  
George Tsirtsis ◽  
Antonios D. Niros ◽  
Sofie Spatharis
Keyword(s):  
Machine Learning ◽  
Learning Algorithms ◽  
Individual Performance ◽  
Optimal Combination ◽  
Machine Learning Algorithms ◽  
Combined Effect ◽  
Different Types ◽  
Open Issue ◽  
The Relationship ◽  
Selection Of

Voting is a commonly used ensemble method aiming to optimize classification predictions by combining results from individual base classifiers. However, the selection of appropriate classifiers to participate in voting algorithm is currently an open issue. In this study we developed a novel Dissimilarity-Performance (DP) index which incorporates two important criteria for the selection of base classifiers to participate in voting: their differential response in classification (dissimilarity) when combined in triads and their individual performance. To develop this empirical index we firstly used a range of different datasets to evaluate the relationship between voting results and measures of dissimilarity among classifiers of different types (rules, trees, lazy classifiers, functions and Bayes). Secondly, we computed the combined effect on voting performance of classifiers with different individual performance and/or diverse results in the voting performance. Our DP index was able to rank the classifier combinations according to their voting performance and thus to suggest the optimal combination. The proposed index is recommended for individual machine learning users as a preliminary tool to identify which classifiers to combine in order to achieve more accurate classification predictions avoiding computer intensive and time-consuming search.

Sign in / Sign up

Export Citation Format

Share Document