[{"data":1,"prerenderedAt":160},["ShallowReactive",2],{"project-33143270":3},{"id":4,"name":5,"line":6,"line_source":7,"title":8,"url":9,"domain":10,"maker":11,"posted_at":12,"year":13,"points":14,"comments":14,"rank_in_year":15,"shown_in_year":16,"top":17,"tier":18,"category":19,"subcategory":20,"format":21,"keywords":22,"reception":27,"sentiment":28,"stance_mix":29,"scored_comments":33,"aspects":34,"strip":36,"post_text":37,"what":38,"said":62,"maker_in_thread":104,"shape":108,"grid":112,"attempts":122,"same_week":123,"maker_shows":33,"maker_hidden":153,"reader_version":154,"card":155},"33143270","Marginalia Related Website Finder","Related Website Finder Experiment Thingy","title","Show HN: Related Website Finder Experiment Thingy","https:\u002F\u002Fexplore2.marginalia.nu\u002F","explore2.marginalia.nu","marginalia_nu",1665336162,2022,5,2356,2570,92,"shown","learning_science","website discovery","web_app",[23,24,25,26,20],"related websites","nearest neighbors","cosine similarity","link graph","quiet",null,{"positive":30,"neutral":31,"mixed":32,"critical":32},2,1,0,3,{"idea":35},{"positive":31,"critical":32},[14,32,33,32,14],"Been messing with cosine similarity and decided to try calculating nearest neighbors over the entire link graph for the marginalia search engine.\n\nTurns out that you can just bruteforce that in a day or two. And the results are pretty good.\n\nOne drawback is that depending on if you're looking at an older website, a lot of the links are dead. The deduplication isn't great either.",{"problem":39,"audience":28,"pricing":28,"motivation":45,"time_to_build":49,"stack":53,"openness":60,"stage":61,"team_size":60},{"value":40,"source":41,"evidence":42},"Finding websites related to a given site across the link graph.","maker",[43],{"id":44},"post",{"value":46,"source":41,"evidence":47},"Experimenting with cosine similarity on the Marginalia link graph.",[48],{"id":44},{"value":50,"source":41,"evidence":51},"A day or two of brute-force computation.",[52],{"id":44},[54],{"value":55,"source":41,"evidence":56},"numpy",[57],{"id":58,"by":11,"text":59},"33152598","Haven't tried all too many methods, a lot of the standard approaches go out the window due to the sheer size of the graph means it can't be loaded into most tools. Got 12 million…","unknown","launched",{"praise":63,"objections":72,"requests":81,"questions":95,"alternatives":103},[64],{"value":65,"source":66,"evidence":67},"Useful for finding niche and older sites on Marginalia.","commenter",[68],{"id":69,"by":70,"text":71},"33145991","nafnlj","This is a great idea. Marginalia Search is already very useful for finding interesting niche\u002Folder articles and posts on many subjects (I have used it regularly to find…",[73,77],{"value":74,"source":41,"evidence":75},"Many links are dead for older websites.",[76],{"id":44},{"value":78,"source":41,"evidence":79},"Deduplication is weak.",[80],{"id":44},[82,88],{"value":83,"source":41,"evidence":84},"Ad-hoc domain filters combined with relatedness ranking in search.",[85],{"id":86,"by":11,"text":87},"33152857","Yeah, I've got a few ideas on how to integrate this further. Just listing them is cool, but it would be exceptionally neat to be able to use this to create ad-hoc filters, and…",{"value":89,"source":66,"evidence":90},"Source code on GitHub.",[91],{"id":92,"by":93,"text":94},"33188766","NibLer","Nice looking project. Is there a GitHub code that I can take a look at?",[96],{"value":97,"source":66,"evidence":98},"Has it been compared to normalized cuts on the adjacency graph?",[99],{"id":100,"by":101,"text":102},"33150703","ad404b8a372f2b9","That's super fun, have you tried comparing it to methods like normalized cuts on the adjacency graph?",[],{"comments":30,"answered":31,"key":105},[106,107],{"id":86,"text":87},{"id":58,"text":59},{"commenters":109,"max_depth":30,"maker_replies":30,"first_comment_mins":110,"lifespan_hours":111},4,315,88,[113,115,117,118,120],[69,32,14,114,70,32],"project\u002Fpositive\u002Fidea",[86,32,32,116,11,31],"project\u002Fneutral\u002Fidea",[100,31,33,116,101,32],[58,31,32,119,11,31],"project\u002Fneutral\u002Fexecution",[92,30,14,121,93,32],"maker\u002Fpositive\u002Fnone",[],[124,129,134,139,144,149],{"id":125,"name":126,"points":127,"category":128},"33155074","InvokeAI",414,"ai",{"id":130,"name":131,"points":132,"category":133},"33153152","agreper",392,"infrastructure",{"id":135,"name":136,"points":137,"category":138},"33147079","Pages on Pages",345,"web_saas",{"id":140,"name":141,"points":142,"category":143},"33150086","playlists.dags.dev",295,"consumer_social",{"id":145,"name":146,"points":147,"category":148},"33164922","Open-Sourcing InboxSDK (YC S11)",257,"dev_tools",{"id":150,"name":151,"points":152,"category":148},"33115719","Lambda-8cc",249,false,"v2",{"id":156,"name":5,"line":6,"ai":153,"cat":19,"year":13,"points":14,"comments":14,"rec":27,"s":28,"top":17,"kw":157,"maker":11,"domain":10,"tier":18,"attempts":32,"strip":158,"url":9,"mix":159,"praise":65,"objection":74,"sub":20},33143270,[23,24,25,26,20],"50305",[30,31,32,32],1794036625953]