<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Bryan__的专栏]]></title><description><![CDATA[https://github.com/YouChouNoBB]]></description><link>https://blog.youkuaiyun.com/Bryan__</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Bryan__]]></copyright><item><title><![CDATA[使用sql快速计算AUC&gAUC]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/125009069</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/125009069</guid><author>Bryan__</author><pubDate>Fri, 27 May 2022 18:30:04 +0800</pubDate><description><![CDATA[原理我就不细说了，通过一次排序就可以计算出auc

整体计算


select
 (ry - 0.5*n1*(n1+1))/n0/n1 as auc
from(
 select
  sum(if(y=0, 1, 0)) as n0, --50
  sum(if(y=1, 1, 0)) as n1,--100
  sum(if(y=1, r, 0)) as ry --100
 from(
  select y, row_number() ove...]]></description><category></category></item><item><title><![CDATA[葵花宝典之大厂晋升(腾讯T11)]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123907190</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123907190</guid><author>Bryan__</author><pubDate>Fri, 01 Apr 2022 21:16:25 +0800</pubDate><description><![CDATA[本人毕业4年解锁鹅厂T11，在鹅厂的答辩都是一次性通过，并且有过多次指导T8/T9/T10一次性晋升成功的经验(成功率超高)，所以在晋升这块有一点点自己的想法，分享出来供大家参考，不过我本身是算法方向的，可能其他方向并不一定适用。]]></description><category></category></item><item><title><![CDATA[有序数组平方后不重复元素个数]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123694990</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123694990</guid><author>Bryan__</author><pubDate>Wed, 23 Mar 2022 20:14:28 +0800</pubDate><description><![CDATA[有序数组平方后不重复元素个数]]></description><category></category></item><item><title><![CDATA[DSIN:Deep Session Interest Network for Click-Through Rate Prediction]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123561370</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123561370</guid><author>Bryan__</author><pubDate>Fri, 18 Mar 2022 22:12:15 +0800</pubDate><description><![CDATA[这是一篇对用户序列建模的论文,用户session内的行为相似,session之间的行为差异较大.其中session根据行为发生的时间进行划分,然后进行兴趣提取,兴趣交互,兴趣激活]]></description><category></category></item><item><title><![CDATA[DUMN : Deep User Match Network for Click-Through Rate Prediction]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123536728</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123536728</guid><author>Bryan__</author><pubDate>Wed, 16 Mar 2022 22:27:08 +0800</pubDate><description><![CDATA[介绍一篇很有意思的论文,DUMN,论文的亮点在于将item侧的行为序列也加入建模,通过计算user to user 的相似度,来表达target user与target item之间的相似度.]]></description><category></category></item><item><title><![CDATA[剑指offer:翻转单词序列]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123430666</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123430666</guid><author>Bryan__</author><pubDate>Fri, 11 Mar 2022 17:55:43 +0800</pubDate><description><![CDATA[翻转单词序列]]></description><category></category></item><item><title><![CDATA[快排&归并&堆排C++版本]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123413339</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123413339</guid><author>Bryan__</author><pubDate>Thu, 10 Mar 2022 22:32:13 +0800</pubDate><description><![CDATA[快排&归并&堆排C++版本]]></description><category></category></item><item><title><![CDATA[在二叉树中找到两个节点的最近公共祖先]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123402830</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123402830</guid><author>Bryan__</author><pubDate>Thu, 10 Mar 2022 15:30:47 +0800</pubDate><description><![CDATA[在二叉树中找到两个节点的最近公共祖先]]></description><category></category></item><item><title><![CDATA[GRU & LSTM]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123373026</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123373026</guid><author>Bryan__</author><pubDate>Wed, 09 Mar 2022 16:12:36 +0800</pubDate><description><![CDATA[循环神经网络GRU原理]]></description><category></category></item><item><title><![CDATA[剑指offer:矩阵中的路径]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123336693</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123336693</guid><author>Bryan__</author><pubDate>Mon, 07 Mar 2022 18:40:54 +0800</pubDate><description><![CDATA[请设计一个函数，用来判断在一个矩阵中是否存在一条包含某字符串所有字符的路径]]></description><category></category></item><item><title><![CDATA[剑指offer:机器人的运动范围]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123335586</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123335586</guid><author>Bryan__</author><pubDate>Mon, 07 Mar 2022 17:44:59 +0800</pubDate><description><![CDATA[机器人的运动范围]]></description><category></category></item><item><title><![CDATA[剑指offer:滑动窗口的最大值]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123313368</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123313368</guid><author>Bryan__</author><pubDate>Sun, 06 Mar 2022 17:13:19 +0800</pubDate><description><![CDATA[给定一个长度为 n 的数组 num 和滑动窗口的大小 size ，找出所有滑动窗口里数值的最大值。]]></description><category></category></item><item><title><![CDATA[剑指offer:序列化二叉树]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123311729</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123311729</guid><author>Bryan__</author><pubDate>Sun, 06 Mar 2022 16:04:48 +0800</pubDate><description><![CDATA[序列化二叉树]]></description><category></category></item><item><title><![CDATA[剑指offer:数据流中的中位数]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123297014</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123297014</guid><author>Bryan__</author><pubDate>Sat, 05 Mar 2022 16:37:59 +0800</pubDate><description><![CDATA[数据流中的中位数]]></description><category></category></item><item><title><![CDATA[剑指offer:二叉搜索树的第k个节点]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123296716</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123296716</guid><author>Bryan__</author><pubDate>Sat, 05 Mar 2022 16:24:47 +0800</pubDate><description><![CDATA[给定一棵结点数为n 二叉搜索树，请找出其中的第 k 小的TreeNode结点值]]></description><category></category></item><item><title><![CDATA[剑指offer:二叉树打印成多行]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123292346</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123292346</guid><author>Bryan__</author><pubDate>Sat, 05 Mar 2022 11:49:56 +0800</pubDate><description><![CDATA[给定一个节点数为 n 二叉树，要求从上到下按层打印二叉树的 val 值，同一层结点从左至右输出，每一层输出一行，将输出的结果存放到一个二维数组中返回]]></description><category></category></item><item><title><![CDATA[剑指offer:按之字形顺序打印二叉树]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123291750</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123291750</guid><author>Bryan__</author><pubDate>Sat, 05 Mar 2022 11:19:53 +0800</pubDate><description><![CDATA[给定一个二叉树，返回该二叉树的之字形层序遍历]]></description><category></category></item><item><title><![CDATA[剑指offer:对称的二叉树]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123286760</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123286760</guid><author>Bryan__</author><pubDate>Fri, 04 Mar 2022 22:33:02 +0800</pubDate><description><![CDATA[给定一棵二叉树，判断其是否是自身的镜像]]></description><category></category></item><item><title><![CDATA[剑指offer:二叉树的下一个结点]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123286303</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123286303</guid><author>Bryan__</author><pubDate>Fri, 04 Mar 2022 22:19:58 +0800</pubDate><description><![CDATA[给定一个二叉树其中的一个结点，请找出中序遍历顺序的下一个结点并且返回]]></description><category></category></item><item><title><![CDATA[剑指offer:构建乘积数组]]></title><link>https://blog.youkuaiyun.com/Bryan__/article/details/123242077</link><guid>https://blog.youkuaiyun.com/Bryan__/article/details/123242077</guid><author>Bryan__</author><pubDate>Wed, 02 Mar 2022 22:28:28 +0800</pubDate><description><![CDATA[构建乘积数组]]></description><category></category></item></channel></rss>