scholarly journals Quantum machine learning with adaptive linear optics

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 496
Author(s):  
Ulysse Chabaud ◽  
Damian Markham ◽  
Adel Sohbi
Keyword(s):  
Machine Learning ◽  
Quantum Algorithms ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Probability Estimation ◽  
Linear Optics ◽  
Classical Simulation ◽  
Supervised Learning Algorithms ◽  
Adaptive Measurements ◽  
Near Term

We study supervised learning algorithms in which a quantum device is used to perform a computational subroutine – either for prediction via probability estimation, or to compute a kernel via estimation of quantum states overlap. We design implementations of these quantum subroutines using Boson Sampling architectures in linear optics, supplemented by adaptive measurements. We then challenge these quantum algorithms by deriving classical simulation algorithms for the tasks of output probability estimation and overlap estimation. We obtain different classical simulability regimes for these two computational tasks in terms of the number of adaptive measurements and input photons. In both cases, our results set explicit limits to the range of parameters for which a quantum advantage can be envisaged with adaptive linear optics compared to classical machine learning algorithms: we show that the number of input photons and the number of adaptive measurements cannot be simultaneously small compared to the number of modes. Interestingly, our analysis leaves open the possibility of a near-term quantum advantage with a single adaptive measurement.

scholarly journals Heart disease prediction using machine learning techniques : a survey

2018 ◽  
Vol 7 (2.8) ◽  
pp. 684 ◽  
Author(s):  
V V. Ramalingam ◽  
Ayantan Dandapath ◽  
M Karthik Raja
Keyword(s):  
Machine Learning ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Machine Learning Techniques ◽  
Support Vector ◽  
Complex Data ◽  
Learning Techniques ◽  
Vector Machines ◽  
Supervised Learning Algorithms ◽  
Life Threatening

Heart related diseases or Cardiovascular Diseases (CVDs) are the main reason for a huge number of death in the world over the last few decades and has emerged as the most life-threatening disease, not only in India but in the whole world. So, there is a need of reliable, accurate and feasible system to diagnose such diseases in time for proper treatment. Machine Learning algorithms and techniques have been applied to various medical datasets to automate the analysis of large and complex data. Many researchers, in recent times, have been using several machine learning techniques to help the health care industry and the professionals in the diagnosis of heart related diseases. This paper presents a survey of various models based on such algorithms and techniques andanalyze their performance. Models based on supervised learning algorithms such as Support Vector Machines (SVM), K-Nearest Neighbour (KNN), NaïveBayes, Decision Trees (DT), Random Forest (RF) and ensemble models are found very popular among the researchers.

scholarly journals Machine Learning Algorithms for Visualization and Prediction Modeling of Boston Crime Data

2020 ◽  
Author(s):  
Jiarui Yin ◽  
Inikuro Afa Michael ◽  
Iduabo John Afa
Keyword(s):  
Machine Learning ◽  
Random Forest ◽  
Decision Tree ◽  
Data Science ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Crime Data ◽  
Detection Analysis ◽  
Supervised Learning Algorithms ◽  
Supervised Methods

Machine learning plays a key role in present day crime detection, analysis and prediction. The goal of this work is to propose methods for predicting crimes classified into different categories of severity. We implemented visualization and analysis of crime data statistics in recent years in the city of Boston. We then carried out a comparative study between two supervised learning algorithms, which are decision tree and random forest based on the accuracy and processing time of the models to make predictions using geographical and temporal information provided by splitting the data into training and test sets. The result shows that random forest as expected gives a better result by 1.54% more accuracy in comparison to decision tree, although this comes at a cost of at least 4.37 times the time consumed in processing. The study opens doors to application of similar supervised methods in crime data analytics and other fields of data science

Machine Learning and Data Mining in Bioinformatics

2012 ◽  
pp. 695-703
Author(s):  
George Tzanis ◽  
Christos Berberidis ◽  
Ioannis Vlahavas
Keyword(s):  
Artificial Intelligence ◽  
Machine Learning ◽  
Data Mining ◽  
Reinforcement Learning ◽  
Supervised Learning ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
The World ◽  
Supervised Learning Algorithms ◽  
Computational Systems

Machine learning is one of the oldest subfields of artificial intelligence and is concerned with the design and development of computational systems that can adapt themselves and learn. The most common machine learning algorithms can be either supervised or unsupervised. Supervised learning algorithms generate a function that maps inputs to desired outputs, based on a set of examples with known output (labeled examples). Unsupervised learning algorithms find patterns and relationships over a given set of inputs (unlabeled examples). Other categories of machine learning are semi-supervised learning, where an algorithm uses both labeled and unlabeled examples, and reinforcement learning, where an algorithm learns a policy of how to act given an observation of the world.

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.

Machine Learning and Data Mining in Bioinformatics

2009 ◽  
pp. 612-621 ◽  
Author(s):  
George Tzanis ◽  
Christos Berberidis ◽  
Ioannis Vlahavas
Keyword(s):  
Artificial Intelligence ◽  
Machine Learning ◽  
Data Mining ◽  
Reinforcement Learning ◽  
Supervised Learning ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
The World ◽  
Supervised Learning Algorithms ◽  
Computational Systems

Machine learning is one of the oldest subfields of artificial intelligence and is concerned with the design and development of computational systems that can adapt themselves and learn. The most common machine learning algorithms can be either supervised or unsupervised. Supervised learning algorithms generate a function that maps inputs to desired outputs, based on a set of examples with known output (labeled examples). Unsupervised learning algorithms find patterns and relationships over a given set of inputs (unlabeled examples). Other categories of machine learning are semi-supervised learning, where an algorithm uses both labeled and unlabeled examples, and reinforcement learning, where an algorithm learns a policy of how to act given an observation of the world.

Predicting the Authenticity of Banknotes Using Supervised Learning

2020 ◽  
Vol 1 (2) ◽  
pp. 1-4
Author(s):  
Priyam Guha ◽  
Abhishek Mukherjee ◽  
Abhishek Verma
Keyword(s):  
Machine Learning ◽  
Supervised Learning ◽  
Confusion Matrix ◽  
Learning Algorithms ◽  
High Accuracy ◽  
Machine Learning Algorithms ◽  
Supervised Machine Learning ◽  
False Negatives ◽  
Supervised Learning Algorithms ◽  
Very High

This research paper deals with using supervised machine learning algorithms to detect authenticity of bank notes. In this research we were successful in achieving very high accuracy (of the order of 99%) by applying some data preprocessing tricks and then running the processed data on supervised learning algorithms like SVM, Decision Trees, Logistic Regression, KNN. We then proceed to analyze the misclassified points. We examine the confusion matrix to find out which algorithms had more number of false positives and which algorithm had more number of False negatives. This research paper deals with using supervised machine learning algorithms to detect authenticity of bank notes. In this research we were successful in achieving very high accuracy (of the order of 99%) by applying some data preprocessing tricks and then running the processed data on supervised learning algorithms like SVM, Decision Trees, Logistic Regression, KNN. We then proceed to analyze the misclassified points. We examine the confusion matrix to find out which algorithms had more number of false positives and which algorithm had more number of False negatives.

Out With the Old and in With the New? An Empirical Comparison of Supervised Learning Algorithms to Predict Recidivism

2015 ◽  
Vol 28 (6) ◽  
pp. 570-600 ◽  
Author(s):  
Grant Duwe ◽  
KiDeuk Kim
Keyword(s):  
Machine Learning ◽  
Supervised Learning ◽  
Predictive Validity ◽  
Logistic Model ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Assessment Instruments ◽  
Data Set ◽  
Supervised Learning Algorithms ◽  
Overall Performance

Recent research has produced mixed results as to whether newer machine learning algorithms outperform older, more traditional methods such as logistic regression in predicting recidivism. In this study, we compared the performance of 12 supervised learning algorithms to predict recidivism among offenders released from Minnesota prisons. Using multiple predictive validity metrics, we assessed the performance of these algorithms across varying sample sizes, recidivism base rates, and number of predictors in the data set. The newer machine learning algorithms generally yielded better predictive validity results. LogitBoost had the best overall performance, followed by Random forests, MultiBoosting, bagged trees, and logistic model trees. Still, the gap between the best and worst algorithms was relatively modest, and none of the methods performed the best in each of the 10 scenarios we examined. The results suggest that multiple methods, including machine learning algorithms, should be considered in the development of recidivism risk assessment instruments.

scholarly journals Leveraging Machine Learning Algorithms For Zero-Day Ransomware Attack

2019 ◽  
Vol 8 (6) ◽  
pp. 4104-4107
Keyword(s):  
Machine Learning ◽  
Random Forest ◽  
Nearest Neighbor ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Supervised Machine Learning ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Supervised Learning Algorithms ◽  
Microsoft Windows

Current global huge cyber protection attacks resulting from Infected Encryption ransomware structures over all international locations and businesses with millions of greenbacks lost in paying compulsion abundance. This type of malware encrypts consumer files, extracts consumer files, and charges higher ransoms to be paid for decryption of keys. An attacker could use different types of ransomware approach to steal a victim's files. Some of ransomware attacks like Scareware, Mobile ransomware, WannaCry, CryptoLocker, Zero-Day ransomware attack etc. A zero-day vulnerability is a software program security flaw this is regarded to the software seller however doesn’t have patch in vicinity to restore a flaw. Despite the fact that machine learning algorithms are already used to find encryption Ransomware. This is based on the analysis of a large number of PE file data Samples (benign software and ransomware utility) makes use of supervised machine learning algorithms for ascertain Zero-day attacks. This work was done on a Microsoft Windows operating system (the most attacked os through encryption ransomware) and estimated it. We have used four Supervised learning Algorithms, Random Forest Classifier , K-Nearest Neighbor, Support Vector Machine and Logistic Regression. Tests using machine learning algorithms evaluate almost null false positives with a 99.5% accuracy with a random forest algorithm.

scholarly journals Detecting Potential Insider Threat: Analyzing Insiders’ Sentiment Exposed in Social Media

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Won Park ◽  
Youngin You ◽  
Kyungho Lee
Keyword(s):  
Machine Learning ◽  
Social Media ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Insider Threat ◽  
Detection Accuracy ◽  
Supervised Learning Algorithms ◽  
Security Compliance ◽  
Malicious Insiders ◽  
Learning Software

In the era of Internet of Things (IoT), impact of social media is increasing gradually. With the huge progress in the IoT device, insider threat is becoming much more dangerous. Trying to find what kind of people are in high risk for the organization, about one million of tweets were analyzed by sentiment analysis methodology. Dataset made by the web service “Sentiment140” was used to find possible malicious insider. Based on the analysis of the sentiment level, users with negative sentiments were classified by the criteria and then selected as possible malicious insiders according to the threat level. Machine learning algorithms in the open-sourced machine learning software “Weka (Waikato Environment for Knowledge Analysis)” were used to find the possible malicious insider. Decision Tree had the highest accuracy among supervised learning algorithms and K-Means had the highest accuracy among unsupervised learning. In addition, we extract the frequently used words from the topic modeling technique and then verified the analysis results by matching them to the information security compliance elements. These findings can contribute to achieve higher detection accuracy by combining individual’s characteristics to the previous studies such as analyzing system behavior.

scholarly journals Identifying incident dementia by applying machine learning to a very large administrative claims dataset

2018 ◽  
Author(s):  
Vijay S. Nori ◽  
Christopher A. Hane ◽  
David C. Martin ◽  
Alexander D. Kravetz ◽  
Darshak M. Sanghavi
Keyword(s):  
Machine Learning ◽  
Predictive Models ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Administrative Claims ◽  
List Type ◽  
Variable Model ◽  
Incident Dementia ◽  
Diagnosis Of Dementia ◽  
Near Term

ABSTRACTINTRODUCTIONAlzheimer’s disease and related dementias (ADRD) are highly prevalent conditions, and prior efforts to develop predictive models have relied on demographic and clinical risk factors using traditional logistical regression methods. We hypothesized that machine-learning algorithms using administrative claims data may represent a novel approach to predicting ADRD.METHODSUsing a national de-identified dataset of more than 125 million patients including over 10,000 clinical, pharmaceutical, and demographic variables, we developed a cohort to train a machine learning model to predict ADRD 4-5 years in advance.RESULTSThe Lasso algorithm selected a 50-variable model with an area under the curve (AUC) of 0.693. Top diagnosis codes in the model were memory loss (780.93), Parkinson’s disease (332.0), mild cognitive impairment (331.83) and bipolar disorder (296.80), and top pharmacy codes were psychoactive drugs.DISCUSSIONMachine learning algorithms can rapidly develop predictive models for ADRD with massive datasets, without requiring hypothesis-driven feature engineering.RESEARCH IN CONTEXTSystematic review: Previous attempts to predict incident dementia have relied on extensive clinical evaluations, cognitive testing, laboratory testing, neuro-imaging, genetic factors, demographics, and lifestyle variables. Applying machine learning to a large administrative claims dataset to identify individuals at increased likelihood for near-term diagnosis of dementia had not been tested.Interpretation: A 50-variable model to identify those at risk for near-term diagnosis of dementia was created and validated. Based on AUC analysis, the model compared favorably with other historical attempts at modeling more traditional forms of data.Future direction: Models, such as the one developed here, could be used to identify populations of higher prior probability for near-term diagnosis of dementia. These could then be subjected to more in-depth scrutiny for intervention or dementia-related research eligibility.

Sign in / Sign up

Export Citation Format

Share Document