http://www.bibsonomy.org/burst/user/wnpxrz/paperBibSonomy BuRST Feed for /user/wnpxrz/paper2008-10-08T13:00:41+02:00Optimizing and profiling users online with Bayesian probabilistic modeling (ResearchIndex)http://www.bibsonomy.org/bibtex/22e952850432f9df8eed72f7ccfcfe7ea/wnpxrzwnpxrz2007-06-28T13:10:56+02:00imported paper toread proj:bk proj:et profiling probabilistic bayesian <span style="color:#555555;">Petri <a href="http://www.bibsonomy.org/author/Nokelainen">Nokelainen</a> und Henry <a href="http://www.bibsonomy.org/author/Tirri">Tirri</a> und Miikka <a href="http://www.bibsonomy.org/author/Miettinen">Miettinen</a> und Tomi <a href="http://www.bibsonomy.org/author/Silander">Silander</a> </span>(<em>2002</em>)Thu Jun 28 13:10:56 CEST 2007Optimizing and profiling users online with Bayesian probabilistic modeling2002imported paper toread proj:bk proj:et profiling probabilistic bayesian A Minimum Encoding Approach to Document Clustering (ResearchIndex)http://www.bibsonomy.org/bibtex/21a26d23ed4b73b13a97ed2f674128cf9/wnpxrzwnpxrz2007-06-28T13:09:05+02:00imported proj:bk proj:et clustering toread paper mml document mdl <span style="color:#555555;">Kimmo <a href="http://www.bibsonomy.org/author/Palin">Palin</a> und Janne <a href="http://www.bibsonomy.org/author/Pasanen">Pasanen</a> und Teemu <a href="http://www.bibsonomy.org/author/Roos">Roos</a> </span>(<em>2002</em>)Thu Jun 28 13:09:05 CEST 2007A Minimum Encoding Approach to Document Clustering2002imported proj:bk proj:et clustering toread paper mml document mdl Bayesian Analysis of Online Newspaper Log Data - Wettig, Lahtinen, Lepola, Myllymaki, Tirri (ResearchIndex)http://www.bibsonomy.org/bibtex/214ed408c8c37b150df5dfb20f42755f4/wnpxrzwnpxrz2007-06-28T13:05:55+02:00log toread proj:et imported paper bayesian <span style="color:#555555;">H. <a href="http://www.bibsonomy.org/author/Wettig">Wettig</a> und J. <a href="http://www.bibsonomy.org/author/Lahtinen">Lahtinen</a> und T. <a href="http://www.bibsonomy.org/author/Lepola">Lepola</a> und P. <a href="http://www.bibsonomy.org/author/Myllymaki">Myllymaki</a> und H. <a href="http://www.bibsonomy.org/author/Tirri">Tirri</a> </span>(<em>2003</em>)Thu Jun 28 13:05:55 CEST 2007Bayesian analysis of online newspaper log data2003log toread proj:et imported paper bayesian PASCAL -http://www.bibsonomy.org/bibtex/22b832823272a9e9ca23b35b93689a1a0/wnpxrzwnpxrz2007-06-28T12:37:36+02:00proj:mh paper toread ir imported proj:et proactive <span style="color:#555555;">Miikka <a href="http://www.bibsonomy.org/author/Miettinen">Miettinen</a> und Ville <a href="http://www.bibsonomy.org/author/Tuulos">Tuulos</a> und Petri <a href="http://www.bibsonomy.org/author/Myllymäki">Myllym&#228;ki</a> </span>(<em>2005</em>)Thu Jun 28 12:37:36 CEST 2007A Testbed for Proactive Information Retrieval.2005proj:mh paper toread ir imported proj:et proactive dblphttp://www.bibsonomy.org/bibtex/206a0059b5439582a083b0c4724d88751/wnpxrzwnpxrz2007-06-28T12:35:48+02:00toread binary proj:et projection proj:bk paper data proj:tags <span style="color:#555555;">Nikolaj <a href="http://www.bibsonomy.org/author/Tatti">Tatti</a> </span><em>Acta Inf.</em><em>42(8-9):617-638</em>(<em>2006</em>)Thu Jun 28 12:35:48 CEST 2007Acta Inf.8-9617-638Safe projections of binary data sets.422006toread binary proj:et projection proj:bk paper data proj:tags dblphttp://www.bibsonomy.org/bibtex/20f619c954398ebc28a27f3cd7dae43c6/wnpxrzwnpxrz2007-06-28T12:35:02+02:00query proj:et complexity proj:bk data toread paper <span style="color:#555555;">Nikolaj <a href="http://www.bibsonomy.org/author/Tatti">Tatti</a> </span><em>Inf. Process. Lett.</em><em>98(5):183-187</em>(<em>2006</em>)Thu Jun 28 12:35:02 CEST 2007Inf. Process. Lett.5183-187Computational complexity of queries based on itemsets.982006query proj:et complexity proj:bk data toread paper dblphttp://www.bibsonomy.org/bibtex/2c4338605adca967339cecf82212fd602/wnpxrzwnpxrz2007-06-28T12:34:21+02:00proj:et proj:bk paper toread distance data proj:tags <span style="color:#555555;">Nikolaj <a href="http://www.bibsonomy.org/author/Tatti">Tatti</a> </span><em>Journal of Machine Learning Research</em>(<em>2007</em>)Thu Jun 28 12:34:21 CEST 2007Journal of Machine Learning Research131-154Distances between Data Sets Based on Summary Statistics.82007proj:et proj:bk paper toread distance data proj:tags What is the Dimension of Your Binary Data?http://www.bibsonomy.org/bibtex/2fa246f9a5491796291788980ccf3d930/wnpxrzwnpxrz2007-06-28T12:33:22+02:00imported dimension paper toread proj:tags data proj:et proj:bk binary <span style="color:#555555;">Nikolaj <a href="http://www.bibsonomy.org/author/Tatti">Tatti</a> und Taneli <a href="http://www.bibsonomy.org/author/Mielikainen">Mielikainen</a> und Aristides <a href="http://www.bibsonomy.org/author/Gionis">Gionis</a> und Heikki <a href="http://www.bibsonomy.org/author/Mannila">Mannila</a> </span><em>ICDM '06: Proceedings of the Sixth International Conference on Data Mining, </em><em>Seite603--612. </em><em>Washington, DC, USA, </em><em>IEEE Computer Society, </em>(<em>2006</em>)Thu Jun 28 12:33:22 CEST 2007Washington, DC, USAICDM '06: Proceedings of the Sixth International Conference on Data Mining603--612What is the Dimension of Your Binary Data?2006imported dimension paper toread proj:tags data proj:et proj:bk binary Many 0/1 datasets have a very large number of variables; however, they are sparse and the dependency structure of the variables is simpler than the number of variables would suggest. Defining the effective dimensionality of such a dataset is a nontrivial problem. We consider the problem of defining a robust measure of dimension for 0/1 datasets, and show that the basic idea of fractal dimension can be adapted for binary data. However, as such the fractal dimension is difficult to interpret. Hence we introduce the concept of normalized fractal dimension. For a dataset D, its normalized fractal dimension counts the number of independent columns needed to achieve the unnormalized fractal dimension of D. The normalized fractal dimension measures the degree of dependency structure of the data. We study the properties of the normalized fractal dimension and discuss its computation. We give empirical results on the normalized fractal dimension, comparing it against PCA.PASCAL -http://www.bibsonomy.org/bibtex/20001cea299e824234863158cc65bcbe2/wnpxrzwnpxrz2007-06-28T10:39:52+02:00topic proj:bk paper web toread proj:et link ir search independent imported <span style="color:#555555;">Wray <a href="http://www.bibsonomy.org/author/Buntine">Buntine</a> und Jaakko <a href="http://www.bibsonomy.org/author/Löfström">L&#246;fstr&#246;m</a> und Sami <a href="http://www.bibsonomy.org/author/Perttu">Perttu</a> und Kimmo <a href="http://www.bibsonomy.org/author/Valtonen">Valtonen</a> </span>(<em>2005</em>)Thu Jun 28 10:39:52 CEST 2007Topic-specific link analysis using independent components for information retrieval2005topic proj:bk paper web toread proj:et link ir search independent imported PASCAL -http://www.bibsonomy.org/bibtex/261342414528ebd81663dfb1b31b6314c/wnpxrzwnpxrz2007-06-28T10:38:08+02:00toread ir search proj:bk imported discrete web proj:et paper pca <span style="color:#555555;">Wray <a href="http://www.bibsonomy.org/author/Buntine">Buntine</a> und Sami <a href="http://www.bibsonomy.org/author/Perttu">Perttu</a> und Ville <a href="http://www.bibsonomy.org/author/Tuulos">Tuulos</a> </span>(<em>2004</em>)Thu Jun 28 10:38:08 CEST 2007Using Discrete PCA on Web Pages2004toread ir search proj:bk imported discrete web proj:et paper pca PASCAL -http://www.bibsonomy.org/bibtex/2484946eed8d7ae62a958ca67df04c9a2/wnpxrzwnpxrz2007-06-28T10:27:27+02:00toread web filtering proj:et imported proj:bk proj:s2s collaborative paper <span style="color:#555555;">Wray <a href="http://www.bibsonomy.org/author/Buntine">Buntine</a> </span>(<em>2005</em>)Thu Jun 28 10:27:27 CEST 2007Random Surfers versus Random Seekers2005toread web filtering proj:et imported proj:bk proj:s2s collaborative paper