PUMA publications for /tag/randomhttps://puma.uni-kassel.de/tag/randomPUMA RSS feed for /tag/random2024-03-28T23:46:38+01:00- Some Experimental Results on Randomly Generating Formal Contexts.https://puma.uni-kassel.de/bibtex/28af414e45f306527e8316ac681fe7f08/03568750035687502016-08-02T18:15:29+02:00FCA concept contexts formal generating myown random <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Daniel Borchmann" itemprop="url" href="/author/Daniel%20Borchmann"><span itemprop="name">D. Borchmann</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Tom Hanika" itemprop="url" href="/author/Tom%20Hanika"><span itemprop="name">T. Hanika</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">CLA</span>, </em></span><em>Volume 1624 von CEUR Workshop Proceedings, </em><em>Seite <span itemprop="pagination">57-69</span>. </em><em><span itemprop="publisher">CEUR-WS.org</span>, </em>(<em><span>2016<meta content="2016" itemprop="datePublished"/></span></em>)
- Random Forestshttps://puma.uni-kassel.de/bibtex/2b8187107bf870043f2f93669958858f1/stephandoerfelstephandoerfel2015-03-19T20:35:07+01:00classification ensemble forest learning random <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Leo Breiman" itemprop="url" href="/author/Leo%20Breiman"><span itemprop="name">L. Breiman</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Machine Learning</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">45 </span></span>(<span itemprop="issueNumber">1</span>):
<span itemprop="pagination">5-32</span></em> </span>(<em><span>2001<meta content="2001" itemprop="datePublished"/></span></em>)Random Forests - Springer
- Theory of random graphshttps://puma.uni-kassel.de/bibtex/27bb074240f72009f515123f15afecefd/stephandoerfelstephandoerfel2014-06-03T18:11:02+02:00density graph random <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Svante Janson" itemprop="url" href="/author/Svante%20Janson"><span itemprop="name">S. Janson</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Tomasz Luczak" itemprop="url" href="/author/Tomasz%20Luczak"><span itemprop="name">T. Luczak</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andrzej Rucinski" itemprop="url" href="/author/Andrzej%20Rucinski"><span itemprop="name">A. Rucinski</span></a></span>. </span><em><span itemprop="publisher">John Wiley & Sons</span>, </em><em>New York; Chichester, </em>(<em><span>2000<meta content="2000" itemprop="datePublished"/></span></em>)Random Graphs: Svante Janson, Tomasz Luczak, Andrzej Rucinski: 9780471175414: Amazon.com: Books
- WikiWalk: random walks on Wikipedia for semantic relatednesshttps://puma.uni-kassel.de/bibtex/2ffd20a7357ca8e87d46e516589a7769e/hothohotho2012-11-11T12:13:46+01:00random relatedness semantic walk wikipedia wikisempaths <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Eric Yeh" itemprop="url" href="/author/Eric%20Yeh"><span itemprop="name">E. Yeh</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Daniel Ramage" itemprop="url" href="/author/Daniel%20Ramage"><span itemprop="name">D. Ramage</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Christopher D. Manning" itemprop="url" href="/author/Christopher%20D.%20Manning"><span itemprop="name">C. Manning</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Eneko Agirre" itemprop="url" href="/author/Eneko%20Agirre"><span itemprop="name">E. Agirre</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Aitor Soroa" itemprop="url" href="/author/Aitor%20Soroa"><span itemprop="name">A. Soroa</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing</span>, </em></span><em>Seite <span itemprop="pagination">41--49</span>. </em><em>Stroudsburg, PA, USA, </em><em><span itemprop="publisher">Association for Computational Linguistics</span>, </em>(<em><span>2009<meta content="2009" itemprop="datePublished"/></span></em>)WikiWalk
- Supervised random walks: predicting and recommending links in social networkshttps://puma.uni-kassel.de/bibtex/2999a159de862039db86fe74f808526e3/stephandoerfelstephandoerfel2012-04-10T09:56:05+02:00predicting random recommending supervised walks <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lars Backstrom" itemprop="url" href="/author/Lars%20Backstrom"><span itemprop="name">L. Backstrom</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jure Leskovec" itemprop="url" href="/author/Jure%20Leskovec"><span itemprop="name">J. Leskovec</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Proceedings of the fourth ACM international conference on Web search and data mining</span>, </em></span><em>Seite <span itemprop="pagination">635--644</span>. </em><em>New York, NY, USA, </em><em><span itemprop="publisher">ACM</span>, </em>(<em><span>2011<meta content="2011" itemprop="datePublished"/></span></em>)Supervised random walks
- Supervised Random Walks: Predicting and Recommending Links in Social Networkshttps://puma.uni-kassel.de/bibtex/2c5cc52fa016b384f9d7b5ae4da841d44/hothohotho2012-04-03T15:05:43+02:00predicting random recommending supervised toread walks <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="L. Backstrom" itemprop="url" href="/author/L.%20Backstrom"><span itemprop="name">L. Backstrom</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="J. Leskovec" itemprop="url" href="/author/J.%20Leskovec"><span itemprop="name">J. Leskovec</span></a></span>. </span>(<em><span>2010<meta content="2010" itemprop="datePublished"/></span></em>)<em>cite arxiv:1011.4071.</em>Supervised Random Walks: Predicting and Recommending Links in Social Networks
- Stacked Conditional Random Fields Exploiting Structural Consistencieshttps://puma.uni-kassel.de/bibtex/27920d13d4fce68bb9a4947585083986e/hothohotho2012-03-08T08:46:42+01:002012 conditional crf fields myown random stacked <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Peter Klügl" itemprop="url" href="/author/Peter%20Kl%c3%bcgl"><span itemprop="name">P. Klügl</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Martin Toepfer" itemprop="url" href="/author/Martin%20Toepfer"><span itemprop="name">M. Toepfer</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Florian Lemmerich" itemprop="url" href="/author/Florian%20Lemmerich"><span itemprop="name">F. Lemmerich</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andreas Hotho" itemprop="url" href="/author/Andreas%20Hotho"><span itemprop="name">A. Hotho</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Frank Puppe" itemprop="url" href="/author/Frank%20Puppe"><span itemprop="name">F. Puppe</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Proceedings of 1st International Conference on Pattern Recognition Applications and Methods ICPRAM</span>, </em></span><em>Seite <span itemprop="pagination">240-248</span>. </em><em>Vilamoura, Algarve, Portugal, </em><em><span itemprop="publisher">SciTePress</span>, </em>(<em><span>2012<meta content="2012" itemprop="datePublished"/></span></em>)
- An Introduction to Conditional Random Fieldshttps://puma.uni-kassel.de/bibtex/249d8c9beb76a8b88739aa9eece7446ee/hothohotho2011-09-14T08:28:16+02:00condi conditional crf fields introduction random <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Charles Sutton" itemprop="url" href="/author/Charles%20Sutton"><span itemprop="name">C. Sutton</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andrew McCallum" itemprop="url" href="/author/Andrew%20McCallum"><span itemprop="name">A. McCallum</span></a></span>. </span>(<em><span>2010<meta content="2010" itemprop="datePublished"/></span></em>)<em>cite arxiv:1011.4088Comment: 90 pages.</em>An Introduction to Conditional Random Fields
- On social networks and collaborative recommendationhttps://puma.uni-kassel.de/bibtex/23a2c3898216376eab27848a7f147ee51/jaeschkejaeschke2011-08-22T10:33:43+02:00collaborative folksonomy random recommender tagging walk <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Ioannis Konstas" itemprop="url" href="/author/Ioannis%20Konstas"><span itemprop="name">I. Konstas</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Vassilios Stathopoulos" itemprop="url" href="/author/Vassilios%20Stathopoulos"><span itemprop="name">V. Stathopoulos</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Joemon M. Jose" itemprop="url" href="/author/Joemon%20M.%20Jose"><span itemprop="name">J. Jose</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval</span>, </em></span><em>Seite <span itemprop="pagination">195--202</span>. </em><em>New York, NY, USA, </em><em><span itemprop="publisher">ACM</span>, </em>(<em><span>2009<meta content="2009" itemprop="datePublished"/></span></em>)
- Random hypergraphs and their applicationshttps://puma.uni-kassel.de/bibtex/2a1533c3b12096f71a2b6b6970eb9934d/benzbenz2011-02-04T16:10:11+01:00newman hypergraph random toread random_graph <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Gourab Ghoshal" itemprop="url" href="/author/Gourab%20Ghoshal"><span itemprop="name">G. Ghoshal</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Vinko Zlatic" itemprop="url" href="/author/Vinko%20Zlatic"><span itemprop="name">V. Zlatic</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Guido Caldarelli" itemprop="url" href="/author/Guido%20Caldarelli"><span itemprop="name">G. Caldarelli</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="M. E. J. Newman" itemprop="url" href="/author/M.%20E.%20J.%20Newman"><span itemprop="name">M. Newman</span></a></span>. </span>(<em><span>2009<meta content="2009" itemprop="datePublished"/></span></em>)<em>cite arxiv:0903.0419Comment: 11 pages, 7 figures.</em>Random hypergraphs and their applications
- The Diameter of a Scale-Free Random Graphhttps://puma.uni-kassel.de/bibtex/26a79d370bf4979548ace69b97a61b2d3/folkefolke2010-05-04T08:55:46+02:00diameter distance geodesic graph mean random <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Béla Bollobás*" itemprop="url" href="/author/B%c3%a9la%20Bollob%c3%a1s*"><span itemprop="name">B. Bollobás*</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Oliver Riordan" itemprop="url" href="/author/Oliver%20Riordan"><span itemprop="name">O. Riordan</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Combinatorica</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">24 </span></span>(<span itemprop="issueNumber">1</span>):
<span itemprop="pagination">5--34</span></em> </span>(<em><span>Januar 2004<meta content="Januar 2004" itemprop="datePublished"/></span></em>)
- A review of random graphshttps://puma.uni-kassel.de/bibtex/238decbe2634cb152b3cb6bd17379392e/folkefolke2010-05-04T08:55:46+02:00graph random theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="M. Karonski" itemprop="url" href="/author/M.%20Karonski"><span itemprop="name">M. Karonski</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Journal of Graph Theory</em></span></span> </span>(<em><span>1982<meta content="1982" itemprop="datePublished"/></span></em>)
- Random sampling and social networks: a survey of various approacheshttps://puma.uni-kassel.de/bibtex/22d15b32284dc31868096f5220dec0e94/folkefolke2010-05-04T08:55:46+02:00graph random review sna theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="O. Frank" itemprop="url" href="/author/O.%20Frank"><span itemprop="name">O. Frank</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Math. Sci. Humaines</em></span></span> </span>(<em><span>1988<meta content="1988" itemprop="datePublished"/></span></em>)
- The diameter of random graphshttps://puma.uni-kassel.de/bibtex/29322d8b8af9747bbdef53b6a481c5ed8/folkefolke2010-05-04T08:55:46+02:00diameter graph random <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="B. Bollobas" itemprop="url" href="/author/B.%20Bollobas"><span itemprop="name">B. Bollobas</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Transactions of the American Mathematical Society</em></span></span> </span>(<em><span>1981<meta content="1981" itemprop="datePublished"/></span></em>)
- Random graphs with arbitrary degree distributions and their applicationshttps://puma.uni-kassel.de/bibtex/208a607a8657ec747029ecbaf8d9f224f/folkefolke2010-05-04T08:55:46+02:00configuration degree distribution function generating graph model random <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="MEJ Newman" itemprop="url" href="/author/MEJ%20Newman"><span itemprop="name">M. Newman</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="SH Strogatz" itemprop="url" href="/author/SH%20Strogatz"><span itemprop="name">S. Strogatz</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="DJ Watts" itemprop="url" href="/author/DJ%20Watts"><span itemprop="name">D. Watts</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Arxiv preprint cond-mat/0007235</em></span></span> </span>(<em><span>2001<meta content="2001" itemprop="datePublished"/></span></em>)
- A critical point for random graphs with a given degree sequencehttps://puma.uni-kassel.de/bibtex/269645e07736cf5cb96efa1401a815cb0/folkefolke2010-05-04T08:55:46+02:00component configuration giant graph model random theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="M. Molloy" itemprop="url" href="/author/M.%20Molloy"><span itemprop="name">M. Molloy</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="B. Reed" itemprop="url" href="/author/B.%20Reed"><span itemprop="name">B. Reed</span></a></span>. </span>(<em><span>1995<meta content="1995" itemprop="datePublished"/></span></em>)
- General formalism for inhomogeneous random graphshttps://puma.uni-kassel.de/bibtex/250374bc391847bb097c46bc38364a7a9/folkefolke2010-05-04T08:55:46+02:00graph k-partite random theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="B. Soderberg" itemprop="url" href="/author/B.%20Soderberg"><span itemprop="name">B. Soderberg</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Phys. Rev. E</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">66 </span></span>(<span itemprop="issueNumber">6</span>):
<span itemprop="pagination">066121</span></em> </span>(<em><span>2002<meta content="2002" itemprop="datePublished"/></span></em>)
- A p* primer: Logit models for social networkshttps://puma.uni-kassel.de/bibtex/2b2e086ec820f42183555e14de772f695/folkefolke2010-05-04T08:55:46+02:00carlo exponential generation graph model monte random simulation sna <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C.J. Anderson" itemprop="url" href="/author/C.J.%20Anderson"><span itemprop="name">C. Anderson</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="S. Wasserman" itemprop="url" href="/author/S.%20Wasserman"><span itemprop="name">S. Wasserman</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="B. Crouch" itemprop="url" href="/author/B.%20Crouch"><span itemprop="name">B. Crouch</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Social Networks</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">21 </span></span>(<span itemprop="issueNumber">1</span>):
<span itemprop="pagination">37--66</span></em> </span>(<em><span>1999<meta content="1999" itemprop="datePublished"/></span></em>)
- PageRank and the random surfer modelhttps://puma.uni-kassel.de/bibtex/2742b675a09d540687fc2c352a883d501/folkefolke2010-05-04T08:55:46+02:00model pagerank random surfer <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="P. Chebolu" itemprop="url" href="/author/P.%20Chebolu"><span itemprop="name">P. Chebolu</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="P. Melsted" itemprop="url" href="/author/P.%20Melsted"><span itemprop="name">P. Melsted</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"> </span>(<em><span>2008<meta content="2008" itemprop="datePublished"/></span></em>)
- A random graph model for massive graphshttps://puma.uni-kassel.de/bibtex/2bbf5b80f716eacb6e82ffc4e389e8d2b/folkefolke2010-05-04T08:55:46+02:00graph pagerank random simrank surfer <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="W. Aiello" itemprop="url" href="/author/W.%20Aiello"><span itemprop="name">W. Aiello</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="F. Chung" itemprop="url" href="/author/F.%20Chung"><span itemprop="name">F. Chung</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="L. Lu" itemprop="url" href="/author/L.%20Lu"><span itemprop="name">L. Lu</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"> </span>(<em><span>2000<meta content="2000" itemprop="datePublished"/></span></em>)