http://www.bibsonomy.org/user/hotho/associationBibSonomy RSS Feed for /user/hotho/associationhttp://www.bibsonomy.org/bibtex/242b4c94cff05ccef031235d661a7a77a/hothohotho2008-05-09T12:06:13+02:00rules detection community clustering association folksonomy del.icio.us *** <span style="color:#555555;">Xin <a href="http://www.bibsonomy.org/author/Li">Li</a> and Lei <a href="http://www.bibsonomy.org/author/Guo">Guo</a> and Yihong E. <a href="http://www.bibsonomy.org/author/Zhao">Zhao</a> </span>(<em>2008</em>) <a href="http://www.bibsonomy.org/bibtex/242b4c94cff05ccef031235d661a7a77a/hotho"><i>Tag-based Social Interest Discovery.</i></a><em>Proceedings of the 17th International World Wide Web Conference, </em><em>page675-684. </em><em>ACM, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/hotho/rules">rules</a> <a href="http://www.bibsonomy.org/user/hotho/detection">detection</a> <a href="http://www.bibsonomy.org/user/hotho/community">community</a> <a href="http://www.bibsonomy.org/user/hotho/clustering">clustering</a> <a href="http://www.bibsonomy.org/user/hotho/association">association</a> <a href="http://www.bibsonomy.org/user/hotho/folksonomy">folksonomy</a> <a href="http://www.bibsonomy.org/user/hotho/del.icio.us">del.icio.us</a> <a href="http://www.bibsonomy.org/user/hotho/***">***</a>] <a href="http://www2008.org/papers/pdf/p675-liA.pdf">URL</a>http://www.bibsonomy.org/bibtex/2c8dbb6371be8d67e3aa1928bd3dd0fed/hothohotho2008-01-15T10:57:12+01:00seminar2006 rules semantic folksonomy myown analysis summerschool sosbuch kdubiq association network 2006 <span style="color:#555555;">Christoph <a href="http://www.bibsonomy.org/author/Schmitz">Schmitz</a> and Andreas <a href="http://www.bibsonomy.org/author/Hotho">Hotho</a> and Robert <a href="http://www.bibsonomy.org/author/Jäschke">J&#228;schke</a> and Gerd <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> </span>(<em>2006</em>) <a href="http://www.bibsonomy.org/bibtex/2c8dbb6371be8d67e3aa1928bd3dd0fed/hotho"><i>Mining Association Rules in Folksonomies.</i></a><em>Data Science and Classification (Proc. IFCS 2006 Conference), </em><em>page261-270. </em><em>Ljubljana, </em><em>Springer, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/hotho/seminar2006">seminar2006</a> <a href="http://www.bibsonomy.org/user/hotho/rules">rules</a> <a href="http://www.bibsonomy.org/user/hotho/semantic">semantic</a> <a href="http://www.bibsonomy.org/user/hotho/folksonomy">folksonomy</a> <a href="http://www.bibsonomy.org/user/hotho/myown">myown</a> <a href="http://www.bibsonomy.org/user/hotho/analysis">analysis</a> <a href="http://www.bibsonomy.org/user/hotho/summerschool">summerschool</a> <a href="http://www.bibsonomy.org/user/hotho/sosbuch">sosbuch</a> <a href="http://www.bibsonomy.org/user/hotho/kdubiq">kdubiq</a> <a href="http://www.bibsonomy.org/user/hotho/association">association</a> <a href="http://www.bibsonomy.org/user/hotho/network">network</a> <a href="http://www.bibsonomy.org/user/hotho/2006">2006</a>] <a href="http://www.kde.cs.uni-kassel.de/hotho/pub/2006/schmitz2006asso_ifcs.pdf">URL</a>Probabilistic Counting Algorithms for Data Base Applications - Flajolet, Martin (ResearchIndex)http://www.bibsonomy.org/bibtex/27ccb5baa7d4e0836127b21468c92a27d/hothohotho2007-11-09T12:38:48+01:00association toread rule counting kdubiq dm <span style="color:#555555;">Philippe <a href="http://www.bibsonomy.org/author/Flajolet">Flajolet</a> and G. <a href="http://www.bibsonomy.org/author/Nigel Martin">Nigel Martin</a> </span>(<em>1985</em>) <a href="http://www.bibsonomy.org/bibtex/27ccb5baa7d4e0836127b21468c92a27d/hotho"><i>Probabilistic Counting Algorithms for Data Base Applications.</i></a><em>Journal of Computer and System Sciences</em><em>volume31. </em><em>page182-209. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/hotho/association">association</a> <a href="http://www.bibsonomy.org/user/hotho/toread">toread</a> <a href="http://www.bibsonomy.org/user/hotho/rule">rule</a> <a href="http://www.bibsonomy.org/user/hotho/counting">counting</a> <a href="http://www.bibsonomy.org/user/hotho/kdubiq">kdubiq</a> <a href="http://www.bibsonomy.org/user/hotho/dm">dm</a>] <a href="http://citeseer.ist.psu.edu/flajolet85probabilistic.html">URL</a>dblphttp://www.bibsonomy.org/bibtex/272825e6a12b3285349fb64c1020383c0/hothohotho2006-05-30T08:02:34+02:00kdd rules lecture 2006 mining constraints association <span style="color:#555555;">Raymond T. <a href="http://www.bibsonomy.org/author/Ng">Ng</a> and Laks V. S. <a href="http://www.bibsonomy.org/author/Lakshmanan">Lakshmanan</a> and Jiawei <a href="http://www.bibsonomy.org/author/Han">Han</a> and Alex <a href="http://www.bibsonomy.org/author/Pang">Pang</a> </span>(<em>1998</em>) <a href="http://www.bibsonomy.org/bibtex/272825e6a12b3285349fb64c1020383c0/hotho"><i>Exploratory Mining and Pruning Optimizations of Constrained Association Rules..</i></a><em>SIGMOD Conference, </em><em>page13-24. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/hotho/kdd">kdd</a> <a href="http://www.bibsonomy.org/user/hotho/rules">rules</a> <a href="http://www.bibsonomy.org/user/hotho/lecture">lecture</a> <a href="http://www.bibsonomy.org/user/hotho/2006">2006</a> <a href="http://www.bibsonomy.org/user/hotho/mining">mining</a> <a href="http://www.bibsonomy.org/user/hotho/constraints">constraints</a> <a href="http://www.bibsonomy.org/user/hotho/association">association</a>] <a href="http://dblp.uni-trier.de/db/conf/sigmod/sigmod98.html#NgLHP98">URL</a>http://www.bibsonomy.org/bibtex/2cce11d670329a38a90f625b8005dfb8d/hothohotho2006-05-30T07:47:50+02:00kdd mining rule association 2006 lecture <span style="color:#555555;">Rakesh <a href="http://www.bibsonomy.org/author/Agrawal">Agrawal</a> and Ramakrishnan <a href="http://www.bibsonomy.org/author/Srikant">Srikant</a> </span>(<em>1994</em>) <a href="http://www.bibsonomy.org/bibtex/2cce11d670329a38a90f625b8005dfb8d/hotho"><i>Fast Algorithms for Mining Association Rules in Large Databases.</i></a><em>VLDB '94: Proceedings of the 20th International Conference on Very Large Data Bases, </em><em>page487--499. </em><em>San Francisco, CA, USA, </em><em>Morgan Kaufmann Publishers Inc., </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/hotho/kdd">kdd</a> <a href="http://www.bibsonomy.org/user/hotho/mining">mining</a> <a href="http://www.bibsonomy.org/user/hotho/rule">rule</a> <a href="http://www.bibsonomy.org/user/hotho/association">association</a> <a href="http://www.bibsonomy.org/user/hotho/2006">2006</a> <a href="http://www.bibsonomy.org/user/hotho/lecture">lecture</a>]http://www.bibsonomy.org/bibtex/2094af08c931c876e20fd0e1e5086583b/hothohotho2006-05-30T07:46:42+02:00association lecture hash table mining rules 2006 kdd <span style="color:#555555;">J.S. <a href="http://www.bibsonomy.org/author/Park">Park</a> and M.S. <a href="http://www.bibsonomy.org/author/Chen">Chen</a> and P.S. <a href="http://www.bibsonomy.org/author/Yu">Yu</a> </span>(<em>1995</em>) <a href="http://www.bibsonomy.org/bibtex/2094af08c931c876e20fd0e1e5086583b/hotho"><i>An effective hash-based algorithm for mining association rules.</i></a><em>Proceedings of the 1995 ACM SIGMOD international conference on Management of data</em><em>page175-186. </em><em>ACM Press New York, NY, USA, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/hotho/association">association</a> <a href="http://www.bibsonomy.org/user/hotho/lecture">lecture</a> <a href="http://www.bibsonomy.org/user/hotho/hash">hash</a> <a href="http://www.bibsonomy.org/user/hotho/table">table</a> <a href="http://www.bibsonomy.org/user/hotho/mining">mining</a> <a href="http://www.bibsonomy.org/user/hotho/rules">rules</a> <a href="http://www.bibsonomy.org/user/hotho/2006">2006</a> <a href="http://www.bibsonomy.org/user/hotho/kdd">kdd</a>]http://www.bibsonomy.org/bibtex/276bb213b1e4c8b14fe7e4f4d2569a4af/hothohotho2006-04-04T21:48:47+02:00combination mining classification association rule <span style="color:#555555;">Bing <a href="http://www.bibsonomy.org/author/Liu">Liu</a> and Wynne <a href="http://www.bibsonomy.org/author/Hsu">Hsu</a> and Yiming <a href="http://www.bibsonomy.org/author/Ma">Ma</a> </span>(<em>1998</em>) <a href="http://www.bibsonomy.org/bibtex/276bb213b1e4c8b14fe7e4f4d2569a4af/hotho"><i>Integrating Classification and Association Rule Mining..</i></a><em>KDD, </em><em>page80-86. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/hotho/combination">combination</a> <a href="http://www.bibsonomy.org/user/hotho/mining">mining</a> <a href="http://www.bibsonomy.org/user/hotho/classification">classification</a> <a href="http://www.bibsonomy.org/user/hotho/association">association</a> <a href="http://www.bibsonomy.org/user/hotho/rule">rule</a>] <a href="http://www.comp.nus.edu.sg/~dm2/publications/kdd98_1.ps">URL</a>http://www.bibsonomy.org/bibtex/28c68af52691fe5b3f4db26dea63c8a31/hothohotho2005-12-20T20:21:42+01:00generalized rules association mining <span style="color:#555555;">R. <a href="http://www.bibsonomy.org/author/Srikant">Srikant</a> and R. <a href="http://www.bibsonomy.org/author/Agrawal">Agrawal</a> </span>(<em>1995</em>) <a href="http://www.bibsonomy.org/bibtex/28c68af52691fe5b3f4db26dea63c8a31/hotho"><i>Mining Generalized Association Rules.</i></a><em>Proceedings of the 21st International Conference on Very Large Databases, </em><em>page407--419. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/hotho/generalized">generalized</a> <a href="http://www.bibsonomy.org/user/hotho/rules">rules</a> <a href="http://www.bibsonomy.org/user/hotho/association">association</a> <a href="http://www.bibsonomy.org/user/hotho/mining">mining</a>]