Written by  on November 1, 2018

梯度提升决策树(Gradient Boosting Decision Tree, GBDT)是一种基于提升决策树(Boosting Tree)的模型以分类回归决策树(Classification and Regression Tree, CART)作为基本分类器的模型。

[Read more...]


Written by  on October 28, 2018

Word2Vec算法是NLP领域一个里程碑式的工作,它可以通过训练把文本内容映射到一个K维的向量,这样就很方便继续在其他一些算法领域里面使用,比如推荐系统或者广告点击率预估等等。它是在2013年由当时还在Google工作的Tomas Mikolov发表,主要两篇论文是《Distributed Representations of Words and Phrases and their Compositionality》和《Efficient Estimation of Word Representations in Vector Space》.

[Read more...]

Logistic Regression

Written by  on October 6, 2018

逻辑斯谛回归因为其易于实现,可解释性强,已经成为了工业界应用最广泛的机器学习算法。这篇文章主要讨论的是二项逻辑斯谛回归 (binominal logistic regression),以下简称LR。

[Read more...]


Written by  on August 18, 2018


[Read more...]


Written by  on August 14, 2018

POJ3020 Antenna Placement Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10821 Accepted: 5324 Description The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, is their discovery of a new, highly noise resistant, antenna. It is called 4DAir, and comes in four types. Each type can only transmit and receive signals in a direction aligned with a (slightly skewed) latitudinal and longitudinal grid, because of the interacting electromagnetic field of the earth. The four types correspond to antennas operating in the directions north, west, south, and east, respectively. Below is an example picture of places of interest, depicted by twelve small rings, and nine 4DAir antennas depicted by ellipses covering them.

[Read more...]


Written by  on August 14, 2018

POJ3041 Asteroids Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 26141 Accepted: 14134 Description Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveniently located at the lattice points of the grid.

[Read more...]

Codeforces #879C

Written by  on November 6, 2017

879C C. Short Program time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Petya learned a new programming language CALPAS. A program in this language always takes one non-negative integer and returns one non-negative integer as well.

[Read more...]


Written by  on February 23, 2017

在自然语言处理或者机器学习相关应用时,通常首先要做的是将每一个样本转换成一个向量,然后将预处理过后的样本聚集在一起以矩阵计算的形式来对数据进行分析,然而很多时候都会碰到向量维度过高矩阵过大带来的计算复杂度太高问题,这个时候就要对样本数据集进行降维处理,也就是通常所说的主成分分析 (Principal components analysis,PCA),在尽可能保持原本数据集的特征的前提下降低数据集维度,简单的线性回归就是一种降维操作(将二维平面上的点用一维的线段来表示)。

[Read more...]


Written by  on December 13, 2016

POJ1182 食物链 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 66244 Accepted: 19522 Description 动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。

[Read more...]

Codeforces #733 D

Written by  on November 2, 2016

733D D. Kostya the Sculptor time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Kostya is a genial sculptor, he has an idea: to carve a marble sculpture in the shape of a sphere. Kostya has a friend Zahar who works at a career. Zahar knows about Kostya’s idea and wants to present him a rectangular parallelepiped of marble from which he can carve the sphere.

[Read more...]