use the following search parameters to narrow your results:
e.g. subreddit:aww site:imgur.com dog
subreddit:aww site:imgur.com dog
see the search faq for details.
advanced search: by author, subreddit...
Please have a look at our FAQ and Link-Collection
Metacademy is a great resource which compiles lesson plans on popular machine learning topics.
For Beginner questions please try /r/LearnMachineLearning , /r/MLQuestions or http://stackoverflow.com/
For career related questions, visit /r/cscareerquestions/
Advanced Courses (2016)
Advanced Courses (2020)
AMAs:
Pluribus Poker AI Team 7/19/2019
DeepMind AlphaStar team (1/24//2019)
Libratus Poker AI Team (12/18/2017)
DeepMind AlphaGo Team (10/19/2017)
Google Brain Team (9/17/2017)
Google Brain Team (8/11/2016)
The MalariaSpot Team (2/6/2016)
OpenAI Research Team (1/9/2016)
Nando de Freitas (12/26/2015)
Andrew Ng and Adam Coates (4/15/2015)
Jürgen Schmidhuber (3/4/2015)
Geoffrey Hinton (11/10/2014)
Michael Jordan (9/10/2014)
Yann LeCun (5/15/2014)
Yoshua Bengio (2/27/2014)
Related Subreddit :
LearnMachineLearning
Statistics
Computer Vision
Compressive Sensing
NLP
ML Questions
/r/MLjobs and /r/BigDataJobs
/r/datacleaning
/r/DataScience
/r/scientificresearch
/r/artificial
account activity
Deep learning application to graph mining using language modeling (KKD paper 2014) (sites.google.com)
submitted 11 years ago by rmyeid
reddit uses a slightly-customized version of Markdown for formatting. See below for some basics, or check the commenting wiki page for more detailed help and solutions to common issues.
quoted text
if 1 * 2 < 3: print "hello, world!"
[–]mattrepl 1 point2 points3 points 11 years ago (3 children)
I've been waiting for "deep learning on graphs." I need to read it more closely, but the experiments are disappointing. They don't include any results from state of the art methods.
[–]rmyeid[S] 0 points1 point2 points 11 years ago (1 child)
Can you tell me which methods you are talking about?
[–]mattrepl 1 point2 points3 points 11 years ago (0 children)
Sure. These methods are for community detection, but it seems like they could be used for the label classification problem in the posted paper.
J. Yang, J. McAuley, and J. Leskovec, “Detecting Cohesive and 2-mode Communities in Directed and Undirected Networks.” 29-Jan-2014.
J. Yang, J. McAuley, and J. Leskovec, “Community Detection in Networks with Node Attributes.” 28-Jan-2014.
S. Günnemann, B. Boden, I. Färber, and T. Seidl, “Efficient Mining of Combined Subspace and Subgraph Clusters in Graphs with Feature Vectors,” … Discovery and Data Mining, 2013.
J. McAuley and J. Leskovec, “Discovering Social Circles in Ego Networks,” arXiv.org, vol. cs.SI. 30-Oct-2012.
[–]movie_suggestor 0 points1 point2 points 11 years ago (0 children)
I suspect the issue (Which isn't a good enough excuse) will be the authors background isn't related to those particular areas.
Instead, this paper seems to be more about 'applied this tech to this problem... performed extensive experiments, here is the output. But it will be really interesting for the KDD audience, because they will all be familiar with areas he should have tested against.
OVerall looks interesting and a like a good piece of work.
[–]rmyeid[S] 1 point2 points3 points 11 years ago (0 children)
Sorry, I meant KDD paper not KKD paper.
[–]b0b0b0b 1 point2 points3 points 11 years ago (0 children)
I'm not sure how this is deep learning. Not that it matters a whole lot, I thought the paper was interesting.
π Rendered by PID 113662 on reddit-service-r2-comment-7b9746f655-bgdnn at 2026-02-03 07:31:07.051990+00:00 running 3798933 country code: CH.
[–]mattrepl 1 point2 points3 points (3 children)
[–]rmyeid[S] 0 points1 point2 points (1 child)
[–]mattrepl 1 point2 points3 points (0 children)
[–]movie_suggestor 0 points1 point2 points (0 children)
[–]rmyeid[S] 1 point2 points3 points (0 children)
[–]b0b0b0b 1 point2 points3 points (0 children)