-
Notifications
You must be signed in to change notification settings - Fork 1.9k
FFM XML Doc And Add One Missing Sample File #3374
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
Codecov Report
@@ Coverage Diff @@
## master #3374 +/- ##
==========================================
+ Coverage 72.7% 72.77% +0.07%
==========================================
Files 807 808 +1
Lines 145172 145452 +280
Branches 16225 16244 +19
==========================================
+ Hits 105541 105849 +308
+ Misses 35217 35183 -34
- Partials 4414 4420 +6
|
docs/samples/Microsoft.ML.Samples/Dynamic/Trainers/BinaryClassification/FactorizationMachine.cs
Show resolved
Hide resolved
src/Microsoft.ML.StandardTrainers/FactorizationMachine/FactorizationMachineTrainer.cs
Show resolved
Hide resolved
/// or [FieldAwareFactorizationMachine(Options)](xref:Microsoft.ML.FactorizationMachineExtensions.FieldAwareFactorizationMachine(Microsoft.ML.BinaryClassificationCatalog.BinaryClassificationTrainers,Microsoft.ML.Trainers.FieldAwareFactorizationMachineTrainer.Options)). | ||
/// | ||
/// In contrast to other binary classifiers which can only support one feature column, field-aware factorization machine can consume multiple feature columns. | ||
/// Each column is viewed a container of some fatures and such a container is called a field. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
a container [](start = 29, length = 12)
as #Resolved
/// or [FieldAwareFactorizationMachine(Options)](xref:Microsoft.ML.FactorizationMachineExtensions.FieldAwareFactorizationMachine(Microsoft.ML.BinaryClassificationCatalog.BinaryClassificationTrainers,Microsoft.ML.Trainers.FieldAwareFactorizationMachineTrainer.Options)). | ||
/// | ||
/// In contrast to other binary classifiers which can only support one feature column, field-aware factorization machine can consume multiple feature columns. | ||
/// Each column is viewed a container of some fatures and such a container is called a field. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
fatures [](start = 50, length = 7)
features #Resolved
/// | ||
/// In contrast to other binary classifiers which can only support one feature column, field-aware factorization machine can consume multiple feature columns. | ||
/// Each column is viewed a container of some fatures and such a container is called a field. | ||
/// The motivation of splitting features into different fields is to model features from different distributions in a different way. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
in a different way [](start = 117, length = 18)
independently #Resolved
/// ### Background | ||
/// Factorization machine family is a powerful model group for supervised learning problems. | ||
/// It was first introduced in Steffen Rendle's [Factorization Machines](http://ieeexplore.ieee.org/document/5694074/?reload=true) paper in 2010. | ||
/// Later, one of its generalized version, field-aware factorization machine, became an important predictive module in recent recommender systems and click-through rate prediction contests. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
version [](start = 38, length = 7)
versions #Resolved
/// Factorization machine family is a powerful model group for supervised learning problems. | ||
/// It was first introduced in Steffen Rendle's [Factorization Machines](http://ieeexplore.ieee.org/document/5694074/?reload=true) paper in 2010. | ||
/// Later, one of its generalized version, field-aware factorization machine, became an important predictive module in recent recommender systems and click-through rate prediction contests. | ||
/// For examples, see winning solutions in Steffen Rendle's KDD-Cup 2012 ([Track 1](http://www.kdd.org/kdd-cup/view/kdd-cup-2012-track-1) and[Track 2](http://www.kdd.org/kdd-cup/view/kdd-cup-2012-track-2)), |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
nd[T [](start = 143, length = 4)
space #Resolved
/// The corresponding score is $\hat{y}\left(\boldsymbol{x}\right) = \left\langle \boldsymbol{w}, \boldsymbol{x} \right\rangle + \sum_{j = 1}^n \sum_{j' = j + 1}^n \left\langle \boldsymbol{v}_{j, {\mathcal F}(j')} , \boldsymbol{v}_{j', {\mathcal F}(j)} \right\rangle x_j x_{j'}$, | ||
/// where $\left\langle \cdot, \cdot \right\rangle$ is the inner product operator, $\boldsymbol{w}\in{\mathbb R}^n$ stores the linear coefficients, and $\boldsymbol{v}_{j, f}\in {\mathbb R}^k$ is the $j$-th feature's representation in the $f$-th field's latent space. | ||
/// Note that $k$ is the latent dimension specified by the user. | ||
/// The predicted label is the sign of $\hat{y}$. If $\hat{y} > 0$, this model predicts true and false otherwise. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
nd false otherwise [](start = 98, length = 18)
otherwise it predicts false. #Resolved
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@@ -14,19 +14,19 @@ namespace Microsoft.ML | |||
public static class FactorizationMachineExtensions | |||
{ | |||
/// <summary> | |||
/// Predict a target using a field-aware factorization machine algorithm. | |||
/// Create an <see cref="FieldAwareFactorizationMachineTrainer"/>, which predicts a target using a field-aware factorization machine trained over boolean label data. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
an [](start = 19, length = 2)
Check with @natke if we need "an" for my PRs there was no "an" or "a" #Resolved
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@@ -63,10 +64,10 @@ public static class FactorizationMachineExtensions | |||
} | |||
|
|||
/// <summary> | |||
/// Predict a target using a field-aware factorization machine algorithm. | |||
/// Create an <see cref="FieldAwareFactorizationMachineTrainer"/>, which predicts a target using a field-aware factorization machine trained over boolean label data. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Create an [](start = 11, length = 62)
Create using advanced options, ... #Resolved
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
src/Microsoft.ML.StandardTrainers/FactorizationMachine/FactorizationMachineCatalog.cs
Outdated
Show resolved
Hide resolved
…zationMachineCatalog.cs
Toward #2522 following #3218.