数学:Mathematics

アルゴリズム:Algorithms

Protected: Structural Regularization Learning with Submodular Optimization (3)Formulation of the structural regularization problem with submodular optimization

Application of submodular function optimization, an optimization method for discrete information, to structural regularization problems and formulations using submodular optimization (linear approximation and steepest effect methods, accelerated proximity gradient method, FISTA, parametric submodular minimization, and splitting algorithms)
アルゴリズム:Algorithms

Protected: Structural regularization learning using submodular optimization (2) Structural sparsity obtained from submodular functions

Structural regularization learning (coupled Lasso and Lovász extensions) by structural sparsity obtained from submodular functions in submodular optimization, an optimization method for discrete information used in digital transformation, artificial intelligence, and machine learning tasks.
Symbolic Logic

Knowledge Graphs and Big Data Processing

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

Protected: Structural regularization learning with submodular optimization (1) Regularization and p-norm review

Review of sparse modeling, regularization and p-norm to consider structural regularization learning with submodular optimization, an optimization technique for discrete information for digital transformation, artificial intelligence and machine learning tasks
IOT技術:IOT Technology

Protected: Maximum Flow and Graph Cut (4) Graphically Representable Submodular Functions

Maximum flow algorithms and pre-flow push methods in graphically representable submodular functions for submodular optimization, an optimization approach for discrete information utilized in digital transformation, artificial intelligence, and machine learning tasks
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

Machine Learning Technology  Artificial Intelligence Technology  Natural Language Processing Technology  Semantic Web Te...
アルゴリズム:Algorithms

Protected: Maximum Flow and Graph Cutting (2)Maximum Flow Algorithm

Ford-Fulkerson's algorithm and Goldberg-Tarjan's algorithm for the maximum flow problem for directed graphs used in digital transformation, artificial intelligence, and machine learning tasks, pre-flow and push methods, increasing path algorithms, and residual networks
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.
タイトルとURLをコピーしました