- 博客(1)
- 资源 (1)
- 收藏
- 关注
转载 随机漫步模型及其实现
随机漫步(Random Walk)思想最早由Karl Pearson在1905年提出,它是一种不规则的变动形式,在变动过程当中的每一步都是随机的。通常来说,随机漫步被假定为具有马尔可夫链的性质,也即是每一个步骤具有“无记忆”的特性,换句话说,每一次变动都不会影响别的变动。除此之外,还有许多更加复杂的随机漫步。在维度方面,随机漫步处于图和面上,或者维度更多的结构中,例如群。
2013-11-14 08:07:26 9854 1
liblinear1.93
LIBLINEAR is a simple package for solving large-scale regularized linear
classification and regression. It currently supports
- L2-regularized logistic regression/L2-loss support vector classification/L1-loss support vector classification
- L1-regularized L2-loss support vector classification/L1-regularized logistic regression
- L2-regularized L2-loss support vector regression/L1-loss support vector regression.
When to use LIBLINEAR but not LIBSVM
====================================
There are some large data for which with/without nonlinear mappings
gives similar performances. Without using kernels, one can
efficiently train a much larger set via linear classification/regression.
These data usually have a large number of features. Document classification
is an example.
Warning: While generally liblinear is very fast, its default solver
may be slow under certain situations (e.g., data not scaled or C is
large). See Appendix B of our SVM guide about how to handle such
cases.
http://www.csie.ntu.edu.tw/~cjlin/papers/guide/guide.pdf
Warning: If you are a beginner and your data sets are not large, you
should consider LIBSVM first.
LIBSVM page:
http://www.csie.ntu.edu.tw/~cjlin/libsvm
2013-10-10
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人