HackerURLs

一次又一次被重新发现的经典。

同一个链接,相隔一年以上,一次又一次被人重新发现、再次冲上 Hacker News 首页。能经受住这种时间检验的,大多是值得一读再读的文章。每篇附中文标题,讨论最热的那些再加上中文导读和高赞评论翻译。

从名人堂开始
  • 4,700+篇经过时间检验的经典

Hall of fame

名人堂

在经典库里看全部精选

上首页次数最多、而且有中文导读的 30 篇。时间轴上每个黑点是一次上首页,空心点是一次没冲上去的投稿。

  1. 正在载入经典…

Archive

经典库

按第一次上首页的年份分布,点柱子筛选。

排序

    About

    这些经典是怎么挑出来的

    1. 01

      合并同一个链接

      读取 Hacker News 自 2006 年以来的全部链接投稿,把 http/https、www、跟踪参数等写法不同的同一篇文章合并成一条。

    2. 02

      只留经得起时间的

      同一链接至少两次拿到 50 分以上(约等于上首页),而且两次相隔一年以上;再由 AI 剔除状态页、产品首页和新闻事件。

    3. 03

      写导读、译评论

      上首页次数最多的 2,000 篇配上中文导读、"为什么经久不衰",并精选翻译 HN 高赞评论。导读由 AI 生成,可能有误。

    算法与计算机科学patents.google.com

    Google 的 PageRank 专利已过期

    Google's PageRank patent has expired

    2次上首页
    3年跨度
    749累计得分
    388条评论

    2019 — 2022,它一次次回到首页

    黑点是上首页(≥ 50 分)的那次投稿,空心点是没冲上去的投稿,点越大分数越高。

    导读

    这个页面是 Google 早期核心专利 PageRank(US6285999B1)的专利页,该专利已经过期。PageRank 用网页之间的链接结构来评估网页重要性,曾是 Google 搜索排序的基础信号。评论围绕它的历史作用、算法能否被专利化,以及它在现代搜索和神经科学中的后续应用展开。

    为什么经久不衰:它既是搜索史的关键节点,又引出算法专利、链接分析和排名演进等长期议题;专利过期让这些讨论在今天仍有现实意义。

    关键词 PageRank搜索算法专利Google

    HN 评论精选

    PageRank 被神话了,Google 的工程执行力和对用户/网络的贴合比单一算法更关键。

    迷思:PageRank 是 Google 成功的秘密。事情没那么简单。它也许短暂地带来过差异,但大约六个月内,每个像样的搜索引擎都以某种形式实现了 page rank。对普通人来说这是个可爱的故事。现实中,当时的搜索已经是在平衡大量信号以形成不错的排名公式,比只应用某个神奇算法难得多。我认为当年构建 Google 搜索的人值得多得多认可。远胜任何算法公式的是 Google 的执行能力,以及以契合网络文化的方式执行。

    bborud查看英文原文

    Myth: PageRank was the secret to Google's success It wasn't really that simple. For a brief while, perhaps it made a difference, but within perhaps a span of 6 months, every decent search engine implemented page rank in one form or another. It is a cute story for the muggles to focus on. In reality search was already then about balancing a large number of signals into a decent ranking formula. It was much, much harder than just applying some magic algorithm and I think the people who built Google search back in those days deserve a lot more credit. But that wasn't really a sexy story, I guess. To a much greater degree than any algorithm or formula: Google's ability to execute, and to do so in cultural sympathy with the web, was more important. Much has been said about Google's Not Invented Here, but this made all the difference in the early days: you had to get things to where you could iterate and innovate fast. And I say that admiringly as someone who worked for one of their competitors at the time. I used to be jealous of Google because they were managed by people who were part of the Internet. Our management was alien to the Internet (and our business model was to power search for portals mainly run by horrible, stupid people in suits). Google was the only search engine that was properly in tune with its audience: focusing on the user. (Disclosure: I worked for FAST, then Yahoo, then Google until I quit Google in 2009)

    从数学家视角看,算法类似数学定理,算法可专利化令人难以接受。

    每隔一阵我就会想起算法居然可以被专利。随之而来的是恐惧和普遍的挫败无力感。然后我慢慢试图忘记这个事实,才能继续在这个疯狂世界里生活。作为数学家,我把算法视为定理的实例,给定理、给数学真理“申请专利”的想法太陌生了。

    enriquto查看英文原文

    Every once and then I remember that you can actually patent algorithms. Terror ensues, and a general feeling of frustration and helplesness. Then I try to forget this fact slowly, just to be able to continue living in this crazy world. As a mathematician, i see algorithms as examples of theorems, and the idea to "patent" a theorem, a mathematical truth, is so foreign!

    PageRank 已被用于神经科学建模,连接性可用来表示重要性和稳定性。

    我看到很多关于 PageRank 的计算机科学讨论,想给一个不太一样的视角。我在 CalTech 的同事最近用 PageRank 算法建模活体神经网络的演化。这个概念很适合建模简单 Hebbian 学习的扩展,并解释一些群体动力学(至少在海马体中)。学习相关网络在数周内会发生群体层面的动态变化,但有些神经元的放电方式/时间非常稳定;可以用 PageRank 之类方法对稳定性排序,说明连接性意味着重要性,也许还意味着稳定性。

    whymauri查看英文原文

    There's a lot of discussion I see about PageRank for CS purposes, so I'd like to give a slightly different perspective most people haven't heard about. A colleague of mine at CalTech recently used the PageRank Algorithm to model the evolution of in-vivo neural networks [0, page 8]. The concept is pretty good for modeling extensions of simple Hebbian learning and explaining some of the ensemble dynamics (at least in the hippocampus). If you're interested in further reading, there's more work on attractor states in biological learning and associative memory (some of which is cited in the paper). Brief overview: there's debate on whether brain network dynamics are stable or unstable. In networks related to learning and over the timespan of weeks, this experiment observed that ensemble-level dynamic change during learning but some neurons are remarkably stable in how/when they fire. You can rank stability with methods like PageRank, suggesting that connectivity implies importance (and perhaps stability). [0] https://www.biorxiv.org/content/biorxiv/early/2019/03/07/559104.full.pdf

    PageRank 仍是基础排序信号,但现代搜索叠加了大量机器学习与细分领域权重。

    我不确定这现在还有多大用处。Google 仍把它用于基础排序,但结果随后会经过多种附加机器学习流水线,比如 Vince(权威/品牌力)、Panda(入链质量)、Penguin(内容质量)等,以及其他针对页面布局、广告位置等属性的系统。还有更细粒度的权重,比如“细分领域内的力量”:新页面可能在管道行业表现不错(因为站点其他页面),但不会自动在医疗话题上有权威。

    tyingq查看英文原文

    I'm not sure how useful this might be to anyone anymore. Google still uses it for the base ranking. But, the results are then run through a variety of add-on ML pipelines, like Vince (authority/brand power), Panda (inbound link quality), Penguin (content quality), and many others that target other attributes (page layout, ad placement, etc). Then there's also more granular weightings for things like "power within a niche", where a new page might do well for plumbing (because of other existing pages on the site), but wouldn't automatically have any authority for medical topics.

    历次讨论

    同类还值得读

    1. 位运算技巧集

      Bit Twiddling Hacks

      斯坦福页面上的经典位运算技巧合集,收录了 popcount、前导/尾随零、位反转、交换、舍入等大量技巧,并附有解释和性能讨论。

      算法与计算机科学上首页 8 次 · 2011–2024graphics.stanford.edu编辑精选
    2. 如何不按平均评分排序

      How Not To Sort By Average Rating

      经典文章解释了为什么按平均评分排序不可靠:只有少量评价的条目(比如仅一条五星)会轻易排到最前,而评价数量的差异被忽略。

      算法与计算机科学上首页 7 次 · 2009–2024evanmiller.org编辑精选
    3. 数据结构可视化

      Data Structure Visualizations

      旧金山大学 David Galles 教授制作的数据结构与算法交互式可视化网站,涵盖 B 树、红黑树、排序、图算法等,可逐步操作观察其运行过程。

      算法与计算机科学上首页 6 次 · 2011–2021cs.usfca.edu编辑精选
    4. 1996 年以来的计算机科学最佳论文奖

      Best Paper Awards in Computer Science since 1996

      Jeff Huang 维护的一个汇总页面,收录了自 1996 年以来计算机科学各主要会议的“最佳论文奖”获奖名单,并按年份和会议整理,方便读者一站式浏览历届获奖论文。

      算法与计算机科学上首页 6 次 · 2010–2018jeffhuang.com编辑精选
    5. 算法(Jeff Erickson)

      Algorithms, by Jeff Erickson

      伊利诺伊大学 Jeff Erickson 教授的算法课教材,免费在线开放。

      算法与计算机科学上首页 5 次 · 2018–2022jeffe.cs.illinois.edu编辑精选

    打赏支持

    打赏二维码

    觉得有用,请作者喝杯咖啡。

    WeChat

    关注向阳乔木

    微信公众号「向阳乔木推荐看」

    微信公众号「向阳乔木推荐看」二维码

    微信扫一扫;在微信里打开本页时,长按二维码识别。