Difference between revisions of "Week 3"

From Research management course
Jump to: navigation, search
 
(15 intermediate revisions by 2 users not shown)
Line 1: Line 1:
 +
{{#seo:
 +
|title=Course My first scientific paper: Week 3
 +
|titlemode=replace
 +
|keywords=My first scientific paper
 +
|description=Course My first scientific paper: The introductory part includes research goals and motivations. It reasons the research with fundamental and state-of-the-art references.
 +
}}
 
The goal is to understand '''the type of problem''' to state and solve.
 
The goal is to understand '''the type of problem''' to state and solve.
 +
 +
== I: Introduction ==
 +
The introductory part includes research goals and motivations. It reasons the research with fundamental and state-of-the-art references. It delivers the main message of the work to the reader. This message shows the novelty of this work in comparison to recent results.
 +
 +
Write Introduction. The expected size is one page. The expected plan is:
 +
# the research goal (and its motivations),
 +
# the object of research (introduce main termini),
 +
# the problem (what is the challenge),
 +
# methodology: literature review and state-of-the-art
 +
# the project tasks,
 +
# the  proposed solution, its novelty, and advantages,
 +
# the profs and cons of recent works,
 +
# goal of the experiment, set up, data sets, workflow.
 +
 +
 +
''Important!'' Wikipedia is not a source of information but contains many useful references.
 +
 +
''Note that!'' ArXiv is not a peer-reviewed source of information. Look for publications of these papers in peer-reviewed scientific journals. Be careful if the ArXiv paper does not appear in a peer-reviewed journal after one or two years. This paper might be non-verified since the other journals rejected it.
 +
 +
Also, to refine your Introduction:
 +
# Create the file ''Surname2018Title.bib'' for your project.
 +
# Move from the file ''LinkReview'' to bibliographic records in the BibTeX format.
 +
#* Check the correctness of the BibTeX database (styles of authors' names, volumes of journals, page numbers).
 +
#* Use [http://liinwww.ira.uka.de/bibliography/  bibliographic databases] to facilitate your work.
 +
#* Use the default style ''\bibliographystyle{plain}'' before the bibliography section ''\bibliography{ProjectN}''.
 +
  
 
== P: Problem statement ==  
 
== P: Problem statement ==  
 
In the paradigm Idea<math>\to</math>Formula<math>\to</math>Code state the problem to find an optimal solution.
 
In the paradigm Idea<math>\to</math>Formula<math>\to</math>Code state the problem to find an optimal solution.
 
# Discuss the problem statement with your adviser.  
 
# Discuss the problem statement with your adviser.  
# See the examples below and in the past projects.
+
# See the examples below and in past projects.
# Discuss terminology and notation see [pdf] and [tex] with notations and a useful style file.  
+
# Discuss terminology and notation. See [pdf] and [tex] with notations and a useful style file.  
# In the beginning of Problem statement write a general problem description.
+
# At the beginning of the Problem statement, write a general problem description.
 
# Describe the elements of your problem statement:
 
# Describe the elements of your problem statement:
 
## the sample set,  
 
## the sample set,  
Line 15: Line 47:
 
## your model in the class of models,
 
## your model in the class of models,
 
## restrictions on the class of models,  
 
## restrictions on the class of models,  
## the error function (and its inference) or a loss function, or a quality criterion,
+
## the error function (and its inference) or a loss function, a quality criterion,
 
## cross-validation procedure,
 
## cross-validation procedure,
 
## restrictions to the solutions,
 
## restrictions to the solutions,
 
## external (industrial) quality criteria,
 
## external (industrial) quality criteria,
 
## the optimization statement as <math>\arg\min</math>.
 
## the optimization statement as <math>\arg\min</math>.
# Define the main termini: what is called the model, the solution, the algorithm.
+
# Define the main termini: what is called the model, the solution, and the algorithm.
  
 
Note that:
 
Note that:
Line 35: Line 67:
  
 
==Resources==
 
==Resources==
* [http://www.machinelearning.ru/wiki/images/f/fc/M1p_lect3.pdf Slides for week 3].
+
===2024===
 +
*[[Media:m1p_2024_lect3_a.pdf|Slides, part a]]
 +
*[[Media:m1p_2024_lect3_b.pdf|Slides, part b]]
 +
*[https://www.youtube.com/watch?v=GSEBi3ttvbk Video]
 +
* Recommended notations: [http://www.machinelearning.ru/wiki/images/0/0f/M1_Notation.pdf pdf] and [http://www.machinelearning.ru/wiki/images/6/6d/M1_Notation_source.zip .tex with .sty]
 +
 
 +
===Old===
 +
* [http://www.machinelearning.ru/wiki/images/f/fc/M1p_lect3.pdf Slides for week 3], slides [http://www.machinelearning.ru/wiki/images/5/55/M1p2022lect3.pdf 2022].
 
* [https://www.youtube.com/watch?v=9ATqp5tyTWI Video for week 3].
 
* [https://www.youtube.com/watch?v=9ATqp5tyTWI Video for week 3].
* Recommended notations, 2019: [http://www.machinelearning.ru/wiki/images/0/0f/M1_Notation.pdf pdf] and [http://www.machinelearning.ru/wiki/images/6/6d/M1_Notation_source.zip .tex with .sty)]]
+
<!-- * Slides [http://www.machinelearning.ru/wiki/images/b/b9/Strijov2020ProblStatement.pdf with a plan of Problem statement]-->
* Slides [http://www.machinelearning.ru/wiki/images/b/b9/Strijov2020ProblStatement.pdf with a plan of Problem statement]
+
 
* Examples of problem statements  
+
===Examples of problem statements===
*#  Katrutsa A.M., Strijov V.V. Stresstest procedure for feature selection algorithms // Chemometrics and Intelligent Laboratory Systems, 2015, 142 : 172-183 [http://strijov.com/papers/Katrutsa2014TestGenerationEn.pdf article]
+
*#  Katrutsa A.M., Strijov V.V. Stresstest procedure for feature selection algorithms // Chemometrics and Intelligent Laboratory Systems, 2015, 142: 172-183 [http://strijov.com/papers/Katrutsa2014TestGenerationEn.pdf article]
 
*# Katrutsa A.M., Strijov V.V. Comprehensive study of feature selection methods to solve multicollinearity problem according to evaluation criteria // Expert Systems with Applications, 2017 [http://strijov.com/papers/Katrutsa2016QPFeatureSelection.pdf article]
 
*# Katrutsa A.M., Strijov V.V. Comprehensive study of feature selection methods to solve multicollinearity problem according to evaluation criteria // Expert Systems with Applications, 2017 [http://strijov.com/papers/Katrutsa2016QPFeatureSelection.pdf article]
*# Motrenko A., Strijov V., Weber G.-W. Bayesian sample size estimation for logistic regression // Journal of Computational and Applied Mathematics, 2014, 255 : 743-752. [http://strijov.com/papers/MotrenkoStrijovWeber2012SampleSize.pdf article]
+
*# Motrenko A., Strijov V., Weber G.-W. Bayesian sample size estimation for logistic regression // Journal of Computational and Applied Mathematics, 2014, 255: 743-752. [http://strijov.com/papers/MotrenkoStrijovWeber2012SampleSize.pdf article]
 
*# Kulunchakov A.S., Strijov V.V. Generation of simple structured Information Retrieval functions by genetic algorithm without stagnation // Expert Systems with Applications, 2017, 85 : 221-230. [http://strijov.com/papers/Kulunchakov2014RankingBySimpleFun.pdf article]
 
*# Kulunchakov A.S., Strijov V.V. Generation of simple structured Information Retrieval functions by genetic algorithm without stagnation // Expert Systems with Applications, 2017, 85 : 221-230. [http://strijov.com/papers/Kulunchakov2014RankingBySimpleFun.pdf article]
 
*# Ivkin N.P. Feature generation for classification and forecasting problems, MIPT, 2013 [https://sourceforge.net/p/mlalgorithms/code/HEAD/tree/Group074/Kuznetsov2013SSAForecasting/doc/Ivkin2013ProblemStatement.pdf?format=raw draft]
 
*# Ivkin N.P. Feature generation for classification and forecasting problems, MIPT, 2013 [https://sourceforge.net/p/mlalgorithms/code/HEAD/tree/Group074/Kuznetsov2013SSAForecasting/doc/Ivkin2013ProblemStatement.pdf?format=raw draft]
Line 49: Line 88:
 
* Simple and useful [http://www.machinelearning.ru/wiki/images/4/41/NiceNotations.pdf notations]
 
* Simple and useful [http://www.machinelearning.ru/wiki/images/4/41/NiceNotations.pdf notations]
 
* Notations for Bayesian model selection, [http://www.machinelearning.ru/wiki/images/0/03/ABS_notations.pdf pdf]
 
* Notations for Bayesian model selection, [http://www.machinelearning.ru/wiki/images/0/03/ABS_notations.pdf pdf]
 +
 +
==Homework==
 +
# Watch the slides in Resources <!--[https://youtu.be/6GNb1kiANNk?list=PLk4h7dmY2eYE2Lp2ScMRSGDxLIbJr4vJ8&t=4093 video].-->
 +
# '''Request feedback''' for your project at its current landed state from consultants and instructors!
 +
# Prepare the '''letter I''' and discuss it with your consultant.
 +
# Look at the useful notations in the Resources above. Select the essential notations and terms.
 +
# Together with your consultant prepare the '''letter P'''.

Latest revision as of 20:02, 2 March 2024

The goal is to understand the type of problem to state and solve.

I: Introduction

The introductory part includes research goals and motivations. It reasons the research with fundamental and state-of-the-art references. It delivers the main message of the work to the reader. This message shows the novelty of this work in comparison to recent results.

Write Introduction. The expected size is one page. The expected plan is:

  1. the research goal (and its motivations),
  2. the object of research (introduce main termini),
  3. the problem (what is the challenge),
  4. methodology: literature review and state-of-the-art
  5. the project tasks,
  6. the proposed solution, its novelty, and advantages,
  7. the profs and cons of recent works,
  8. goal of the experiment, set up, data sets, workflow.


Important! Wikipedia is not a source of information but contains many useful references.

Note that! ArXiv is not a peer-reviewed source of information. Look for publications of these papers in peer-reviewed scientific journals. Be careful if the ArXiv paper does not appear in a peer-reviewed journal after one or two years. This paper might be non-verified since the other journals rejected it.

Also, to refine your Introduction:

  1. Create the file Surname2018Title.bib for your project.
  2. Move from the file LinkReview to bibliographic records in the BibTeX format.
    • Check the correctness of the BibTeX database (styles of authors' names, volumes of journals, page numbers).
    • Use bibliographic databases to facilitate your work.
    • Use the default style \bibliographystyle{plain} before the bibliography section \bibliography{ProjectN}.


P: Problem statement

In the paradigm Idea\(\to\)Formula\(\to\)Code state the problem to find an optimal solution.

  1. Discuss the problem statement with your adviser.
  2. See the examples below and in past projects.
  3. Discuss terminology and notation. See [pdf] and [tex] with notations and a useful style file.
  4. At the beginning of the Problem statement, write a general problem description.
  5. Describe the elements of your problem statement:
    1. the sample set,
    2. its origin, or its algebraic structure,
    3. statistical hypotheses of data generation,
    4. [conditions of measurements] ,
    5. [restrictions of the sample set and its values],
    6. your model in the class of models,
    7. restrictions on the class of models,
    8. the error function (and its inference) or a loss function, a quality criterion,
    9. cross-validation procedure,
    10. restrictions to the solutions,
    11. external (industrial) quality criteria,
    12. the optimization statement as \(\arg\min\).
  6. Define the main termini: what is called the model, the solution, and the algorithm.

Note that:

  • The model is a parametric family of functions to map design space to target space.
  • The criterion (error function) is a function to optimize in order to obtain an optimal solution (model parameters, a function).
  • The algorithm transforms solution space, usually iteratively.
  • The method combines a model, a criterion, and an algorithm to produce a solution.

Check it:

  • the regression model,
  • the sum of squared errors,
  • the Newton-Raphson algorithm,
  • the method of least squares.

Resources

2024

Old

Examples of problem statements

    1. Katrutsa A.M., Strijov V.V. Stresstest procedure for feature selection algorithms // Chemometrics and Intelligent Laboratory Systems, 2015, 142: 172-183 article
    2. Katrutsa A.M., Strijov V.V. Comprehensive study of feature selection methods to solve multicollinearity problem according to evaluation criteria // Expert Systems with Applications, 2017 article
    3. Motrenko A., Strijov V., Weber G.-W. Bayesian sample size estimation for logistic regression // Journal of Computational and Applied Mathematics, 2014, 255: 743-752. article
    4. Kulunchakov A.S., Strijov V.V. Generation of simple structured Information Retrieval functions by genetic algorithm without stagnation // Expert Systems with Applications, 2017, 85 : 221-230. article
    5. Ivkin N.P. Feature generation for classification and forecasting problems, MIPT, 2013 draft
  • Notations for wiki Ru
  • Basic notations, pdf
  • Simple and useful notations
  • Notations for Bayesian model selection, pdf

Homework

  1. Watch the slides in Resources
  2. Request feedback for your project at its current landed state from consultants and instructors!
  3. Prepare the letter I and discuss it with your consultant.
  4. Look at the useful notations in the Resources above. Select the essential notations and terms.
  5. Together with your consultant prepare the letter P.