確率・統計:Probability and Statistics

Symbolic Logic

Protected: Maximum Flow and Graph Cut (3) Inference and Graph Cut in Markov Stochastic Fields

Inference and graph cuts in Markov stochastic fields for graph maximal flow extraction by undermodular optimization, a discrete information optimization method for digital transformation, artificial intelligence, and machine learning tasks
Symbolic Logic

Inductive logic programming 2020-2021 Papers

In the previous article, we discussed the ILP 2019. This time we will discuss the ILP 2021, which was skipp...
Symbolic Logic

Protected: Maximum flow and graph cut (1) Maximum volume and minimum s-t cut

Application of undermodular optimization, an optimization method for discrete information used in digital transformation, artificial intelligence, and machine learning tasks, to minimum cut and maximum flow problems for directed graphs
Symbolic Logic

Protected: Maximization of submodular functions and application of the greedy method (2) Sensor placement problem and active learning problem

Application of submodular function maximization and greedy methods to sensor placement and active learning problems in submodular optimization, a method of optimization of discrete information used in digital transformation, artificial intelligence, and machine learning tasks.
Symbolic Logic

Inductive logic Programming 2019

Machine Learning Technology  Artificial Intelligence Technology  Natural Language Processing Technology  Semantic Web Te...
IOT技術:IOT Technology

Protected: Maximization of submodular functions and application of the greedy method (1) Overview of the greedy method and its application to document summarization

Optimization methods for discrete information used in digital transformation, artificial intelligence, and machine learning tasks: application of greedy methods to undermodular function maximization and its use in document summarization tasks
Symbolic Logic

Inductive logic Programming 2018

In the previous article, we discussed ILP2017. In this issue, I will discuss ILP2018 held in Ferrara, Italy...
Symbolic Logic

Protected: Fundamentals of Submodular Optimization (3)Algorithm for Submodular Function Minimization Problem Using the Minimum Norm Point of the Fundamental Polyhedron

Algorithm for a submodular function minimization problem using base polyhedral minimum norm points, one of the methods of optimization methods (submodular optimization) for discrete information used in digital transformation, artificial intelligence, and machine learning tasks.
Symbolic Logic

Protected: Fundamentals of Submodular Optimization (2) Basic Properties of Submodular Functions

Three basic properties of submodular functions (normalized, non-negative, symmetric) as a basis for optimization algorithms (submodular optimization) of discrete information for digital transformation, artificial intelligence and machine learning tasks and their application to graph cut maximization and minimization problems
Symbolic Logic

Protected: Fundamentals of Submodular Optimization (1) Definition and Examples of Submodular Functions

Submodular functions (cover functions, graph cut functions, concave functions) and optimization as a basis for discrete information optimization algorithms for digital transformation, artificial intelligence, and machine learning tasks
タイトルとURLをコピーしました