scholarly journals Russian Court Decisions Data Analysis Using Distributed Computing and Machine Learning to Improve Lawmaking and Law Enforcement

2019 ◽  
Vol 156 ◽  
pp. 264-273 ◽  
Author(s):  
Oleg Metsker ◽  
Egor Trofimov ◽  
Max Petrov ◽  
Nikolay Butakov
Keyword(s):  
Machine Learning ◽  
Data Analysis ◽  
Law Enforcement ◽  
Distributed Computing ◽  
Court Decisions

Machine Learning Based Predictive Action on Categorical Non-Sequential Data

2020 ◽  
Vol 13 (5) ◽  
pp. 1020-1030
Author(s):  
Pradeep S. ◽  
Jagadish S. Kallimani
Keyword(s):  
Machine Learning ◽  
Data Analysis ◽  
Categorical Data ◽  
Numerical Data ◽  
Processing Technique ◽  
Machine Learning Algorithms ◽  
Sequential Data ◽  
Industry Standard ◽  
Robust Model ◽  
Future Work

Background: With the advent of data analysis and machine learning, there is a growing impetus of analyzing and generating models on historic data. The data comes in numerous forms and shapes with an abundance of challenges. The most sorted form of data for analysis is the numerical data. With the plethora of algorithms and tools it is quite manageable to deal with such data. Another form of data is of categorical nature, which is subdivided into, ordinal (order wise) and nominal (number wise). This data can be broadly classified as Sequential and Non-Sequential. Sequential data analysis is easier to preprocess using algorithms. Objective: The challenge of applying machine learning algorithms on categorical data of nonsequential nature is dealt in this paper. Methods: Upon implementing several data analysis algorithms on such data, we end up getting a biased result, which makes it impossible to generate a reliable predictive model. In this paper, we will address this problem by walking through a handful of techniques which during our research helped us in dealing with a large categorical data of non-sequential nature. In subsequent sections, we will discuss the possible implementable solutions and shortfalls of these techniques. Results: The methods are applied to sample datasets available in public domain and the results with respect to accuracy of classification are satisfactory. Conclusion: The best pre-processing technique we observed in our research is one hot encoding, which facilitates breaking down the categorical features into binary and feeding it into an Algorithm to predict the outcome. The example that we took is not abstract but it is a real – time production services dataset, which had many complex variations of categorical features. Our Future work includes creating a robust model on such data and deploying it into industry standard applications.

Machine learning-assisted production data analysis in liquid-rich Duvernay Formation

2021 ◽  
Vol 200 ◽  
pp. 108377
Author(s):  
Bing Kong ◽  
Zhuoheng Chen ◽  
Shengnan Chen ◽  
Tianjie Qin
Keyword(s):  
Machine Learning ◽  
Data Analysis ◽  
Production Data

PODC 2020 Review

2021 ◽  
Vol 51 (4) ◽  
pp. 75-81
Author(s):  
Ahad Mirza Baig ◽  
Alkida Balliu ◽  
Peter Davies ◽  
Michal Dory
Keyword(s):  
Machine Learning ◽  
Distributed Computing ◽  
Keynote Speaker ◽  
Lively Discussion ◽  
Theoretical Understanding ◽  
New Directions ◽  
New Ideas ◽  
New Challenges ◽  
The Impact ◽  
Distributed Machine Learning

Rachid Guerraoui was the rst keynote speaker, and he got things o to a great start by discussing the broad relevance of the research done in our community relative to both industry and academia. He rst argued that, in some sense, the fact that distributed computing is so pervasive nowadays could end up sti ing progress in our community by inducing people to work on marginal problems, and becoming isolated. His rst suggestion was to try to understand and incorporate new ideas coming from applied elds into our research, and argued that this has been historically very successful. He illustrated this point via the distributed payment problem, which appears in the context of blockchains, in particular Bitcoin, but then turned out to be very theoretically interesting; furthermore, the theoretical understanding of the problem inspired new practical protocols. He then went further to discuss new directions in distributed computing, such as the COVID tracing problem, and new challenges in Byzantine-resilient distributed machine learning. Another source of innovation Rachid suggested was hardware innovations, which he illustrated with work studying the impact of RDMA-based primitives on fundamental problems in distributed computing. The talk concluded with a very lively discussion.

scholarly journals Classification of apatite structures via topological data analysis: a framework for a ‘Materials Barcode’ representation of structure maps

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Scott Broderick ◽  
Ruhil Dongol ◽  
Tianmu Zhang ◽  
Krishna Rajan
Keyword(s):  
Machine Learning ◽  
Data Analysis ◽  
Crystal Chemistry ◽  
Persistent Homology ◽  
Hierarchical Classification ◽  
Topological Data Analysis ◽  
Learning Tool ◽  
Coordination Polyhedra ◽  
Machine Learning Tool ◽  
Topological Data

AbstractThis paper introduces the use of topological data analysis (TDA) as an unsupervised machine learning tool to uncover classification criteria in complex inorganic crystal chemistries. Using the apatite chemistry as a template, we track through the use of persistent homology the topological connectivity of input crystal chemistry descriptors on defining similarity between different stoichiometries of apatites. It is shown that TDA automatically identifies a hierarchical classification scheme within apatites based on the commonality of the number of discrete coordination polyhedra that constitute the structural building units common among the compounds. This information is presented in the form of a visualization scheme of a barcode of homology classifications, where the persistence of similarity between compounds is tracked. Unlike traditional perspectives of structure maps, this new “Materials Barcode” schema serves as an automated exploratory machine learning tool that can uncover structural associations from crystal chemistry databases, as well as to achieve a more nuanced insight into what defines similarity among homologous compounds.

Sign in / Sign up

Export Citation Format

Share Document