TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Ask HN: How would you code this? (noob question)

1 pointsby nikalras1over 5 years ago
Sorry if this is too easy.<p>Image you have all the public LinkedIn profiles :)<p>How would you write an algorithm that: * receives an input of linkedin profile(s) * returns an output of different linkedin profiles<p>such that output profiles are &#x27;similar&#x27; to input profiles<p>Example: - Marketing segmentation analysis. You give me your current customers e.g. head of sales at slack etc and I give you other head of sales at tech companies - Investors: You give me a list of investors you are currently talking to and we give you back a list of potential investors in your space - Sales - Hiring etc<p>Any ideas or links would be greatly appreciated. Are there any general algorithms that can do that?

4 comments

discordanceover 5 years ago
Look into recommendation systems. A lot of learning materials out there (check out the Google course and this awesome list[0,1]). Start with some simple stuff like collaborative filtering and content based filtering.<p>0:<a href="https:&#x2F;&#x2F;developers.google.com&#x2F;machine-learning&#x2F;recommendation" rel="nofollow">https:&#x2F;&#x2F;developers.google.com&#x2F;machine-learning&#x2F;recommendatio...</a> 1: <a href="https:&#x2F;&#x2F;github.com&#x2F;grahamjenson&#x2F;list_of_recommender_systems" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;grahamjenson&#x2F;list_of_recommender_systems</a>
spacedog11over 5 years ago
If I were in your place, I would start by scraping LinkedIn using Python or Golang and creating a large database, keeping relevant information and keywords for each user. Then I would come up with some sort of clever algorithm to sort the data into some kind of sparse graph with takes into account the distance between the nodes (i.e. how close each of the user is to one another) and then use a search algorithm to search for a specific user and or a number of closely related users.
mindcrimeover 5 years ago
<a href="https:&#x2F;&#x2F;stackoverflow.com&#x2F;questions&#x2F;44886756&#x2F;simple-k-means-clustering-for-bag-of-words-model-using-python" rel="nofollow">https:&#x2F;&#x2F;stackoverflow.com&#x2F;questions&#x2F;44886756&#x2F;simple-k-means-...</a>
WalterSearover 5 years ago
<a href="https:&#x2F;&#x2F;www.fast.ai" rel="nofollow">https:&#x2F;&#x2F;www.fast.ai</a>