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.

Show HN: Invitation Engine for Facebook Apps

55 pointsby deepkutalmost 13 years ago
We spent a lot of time working on this, including the demo, and we'd love some feedback.<p>It might take a little bit of time to load if lots of people are trying the demo, so please try to be patient. We spent a lot of time to ensure you'll be impressed.<p>Feel free to email us at tony or chuck @graphmuse.com if you'd like to discuss further!

10 comments

patrickambronalmost 13 years ago
I personally just don't like app invites. I don't use them, and I literally never pay attention to ones I get.<p>That said, the clusters are really impressive. All of my clusters were basically just groups of people from different times/events of my life (highschool people/friends, college friends, colleagues, people I knew when I lived in Syracuse, etc). It's an obvious way to separate my groups of networks, and it was fast. That's useful in so many contexts
评论 #4251126 未加载
评论 #4251771 未加载
评论 #4251446 未加载
评论 #4251285 未加载
habosaalmost 13 years ago
Hi Tony.<p>I just demoed the app and it's awesome, it basically identified all of my friends into perfect groups, with only a little confusion. Obvious groups like "people I met when I spent a summer at Brown" were 100% accurate and blew me away. High school and college also got their own clearly defined groups. Way to go, I hope other people are as interested as I am.
评论 #4252262 未加载
评论 #4252245 未加载
far33dalmost 13 years ago
It's not clear to me that the main hypothesis of this engine is correct - namely, that request recipients who are closely clustered to other users are more likely to accept the request. Do you have data that supports this hypothesis?<p>That said - request recipient optimization works, and offering it as a service could be a successful business. I think your primary value proposition (higher CTR's on lower volume) is solid, but would like to see verification that your approach (using clustering) is valid for that use case.
评论 #4251694 未加载
engtechalmost 13 years ago
Wow. You built 10 clusters, and I could have clearly given a name to each cluster.<p>As part of your demo, you should let me build a list based on each cluster.
评论 #4252529 未加载
verganileonardoalmost 13 years ago
I tried the demo and received this message:<p>Uncaught Error. {"errorCode": 6, "errorStr": "Internal operation failure, unable to reticulate splines!"}
评论 #4251565 未加载
评论 #4251567 未加载
patjaalmost 13 years ago
How will this be monetized? I can't imagine it being free in perpetuity if it catches on.<p>What about security? Passing Facebook user access tokens over http opens them up to being sniffed on the wire, which would allow anyone to impersonate a user of your app. Maybe ssl is supported, but all of the api documentation examples use http.
评论 #4251820 未加载
评论 #4251793 未加载
KingOfBalmost 13 years ago
Another method of productizing the technology could be an automatic group generator. I'd pay 5$ to have all my friends merged into mutual groups. I have 500 friends and there's no way I'm going to create groups for all of them. But having them grouped would be nice.
评论 #4252068 未加载
mikeboalmost 13 years ago
Can you give more info on how you are clustering friends? AFAIK Facebook doesn't allow you to fetch friends of friends, so curious how you're finding overlapping connections.
评论 #4253346 未加载
caseralmost 13 years ago
I could see this as a better way to organize my news feed. Facebook is trying to do this a bit with "Groups @ xxxx", but this has grouped people better than that.
评论 #4252982 未加载
chuinardalmost 13 years ago
Nice work using arbor.js. I've been trying to get a grasp myself on how to use it. What do you think about the ease of using the framework?
评论 #4251292 未加载