<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Sat, 26 Jul 2008 07:44:07 BST</pubDate>


	<title>CiteULike: mshafiei's clustering</title>
	<description>CiteULike: mshafiei's clustering</description>


	<link>http://www.citeulike.org/user/mshafiei/tag/clustering</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/874146"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/607999"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/2647146"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/2594275"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/2453881"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/2570774"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/2517325"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/2458674"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/1239722"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/2304494"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/1983303"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/1952481"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/965794"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/mshafiei/article/874146">
    <title>Bibliometric impact measures leveraging topic analysis</title>
    <link>http://www.citeulike.org/user/mshafiei/article/874146</link>
    <description>&lt;i&gt;(2006), pp. 65-74.&lt;/i&gt;</description>
    <dc:title>Bibliometric impact measures leveraging topic analysis</dc:title>

    <dc:creator>Gideon Mann</dc:creator>
    <dc:creator>David Mimno</dc:creator>
    <dc:creator>Andrew Mccallum</dc:creator>
    <dc:identifier>doi:10.1145/1141753.1141765</dc:identifier>
    <dc:source>(2006), pp. 65-74.</dc:source>
    <dc:date>2006-09-26T18:30:44-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:startingPage>65</prism:startingPage>
    <prism:endingPage>74</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>bibliometrics</prism:category>
    <prism:category>clustering</prism:category>
    <prism:category>digital_libraries</prism:category>
    <prism:category>impact</prism:category>
    <prism:category>measures</prism:category>
    <prism:category>topic</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/607999">
    <title>Bipartite graph partitioning and data clustering</title>
    <link>http://www.citeulike.org/user/mshafiei/article/607999</link>
    <description>&lt;i&gt;(2001), pp. 25-32.&lt;/i&gt;</description>
    <dc:title>Bipartite graph partitioning and data clustering</dc:title>

    <dc:creator>Hongyuan Zha</dc:creator>
    <dc:creator>Xiaofeng He</dc:creator>
    <dc:creator>Chris Ding</dc:creator>
    <dc:creator>Horst Simon</dc:creator>
    <dc:creator>Ming Gu</dc:creator>
    <dc:identifier>doi:10.1145/502585.502591</dc:identifier>
    <dc:source>(2001), pp. 25-32.</dc:source>
    <dc:date>2006-04-30T15:04:00-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:startingPage>25</prism:startingPage>
    <prism:endingPage>32</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>clustering</prism:category>
    <prism:category>spectral</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/2647146">
    <title>Spectral clustering and transductive learning with multiple views</title>
    <link>http://www.citeulike.org/user/mshafiei/article/2647146</link>
    <description>&lt;i&gt;(2007), pp. 1159-1166.&lt;/i&gt;</description>
    <dc:title>Spectral clustering and transductive learning with multiple views</dc:title>

    <dc:creator>Dengyong Zhou</dc:creator>
    <dc:creator>Christopher Burges</dc:creator>
    <dc:identifier>doi:10.1145/1273496.1273642</dc:identifier>
    <dc:source>(2007), pp. 1159-1166.</dc:source>
    <dc:date>2008-04-09T19:37:58-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:startingPage>1159</prism:startingPage>
    <prism:endingPage>1166</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>clustering</prism:category>
    <prism:category>graphs</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/2594275">
    <title>Clustering with Soft and Group Constraints</title>
    <link>http://www.citeulike.org/user/mshafiei/article/2594275</link>
    <description>&lt;i&gt;Structural, Syntactic, and Statistical Pattern Recognition (2004), pp. 662-670.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Several clustering algorithms equipped with pairwise hard constraints between data points are known to improve the accuracy of clustering solutions. We develop a new clustering algorithm that extends mixture clustering in the presence of (i) soft constraints, and (ii) group-level constraints. Soft constraints can reflect the uncertainty associated with a priori knowledge about pairs of points that should or should not belong to the same cluster, while group-level constraints can capture larger building blocks of the target partition when afforded by the side information. Assuming that the data points are generated by a mixture of Gaussians, we derive the EM algorithm to estimate the parameters of different clusters. Empirical study demonstrates that the use of soft constraints results in superior data partitions normally unattainable without constraints. Further, the solutions are more robust when the hard constraints may be incorrect.</description>
    <dc:title>Clustering with Soft and Group Constraints</dc:title>

    <dc:creator>Martin Law</dc:creator>
    <dc:creator>Alexander Topchy</dc:creator>
    <dc:creator>Anil Jain</dc:creator>
    <dc:source>Structural, Syntactic, and Statistical Pattern Recognition (2004), pp. 662-670.</dc:source>
    <dc:date>2008-03-26T14:07:31-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:publicationName>Structural, Syntactic, and Statistical Pattern Recognition</prism:publicationName>
    <prism:startingPage>662</prism:startingPage>
    <prism:endingPage>670</prism:endingPage>
    <prism:category>clustering</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/2453881">
    <title>A Segment-based Approach To Clustering Multi-Topic Documents</title>
    <link>http://www.citeulike.org/user/mshafiei/article/2453881</link>
    <description>&lt;i&gt;(2008)&lt;/i&gt;</description>
    <dc:title>A Segment-based Approach To Clustering Multi-Topic Documents</dc:title>

    <dc:creator>Andrea Tagarelli</dc:creator>
    <dc:creator>George Karypis</dc:creator>
    <dc:source>(2008)</dc:source>
    <dc:date>2008-03-01T22:10:31-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:category>clustering</prism:category>
    <prism:category>segmentation</prism:category>
    <prism:category>topic_detection</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/2570774">
    <title>The Matrix Stick-Breaking Process: Flexible Bayes Meta-Analysis</title>
    <link>http://www.citeulike.org/user/mshafiei/article/2570774</link>
    <description>&lt;i&gt;pp. 317-327.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In analyzing data from multiple related studies, it often is of interest to borrow information across studies and to cluster similar studies. Although parametric hierarchical models are commonly used, of concern is sensitivity to the form chosen for the random-effects distribution. A Dirichlet process (DP) prior can allow the distribution to be unknown, while clustering studies; however, the DP does not allow local clustering of studies with respect to a subset of the coefficients without making independence assumptions. Motivated by this problem, we propose a matrix stick-breaking process (MSBP) as a prior for a matrix of random probability measures. Properties of the MSBP are considered, and methods are developed for posterior computation using Markov chain Monte Carlo. Using the MSBP as a prior for a matrix of study-specific regression coefficients, we demonstrate advantages over parametric modeling in simulated examples. The methods are further illustrated using a multinational uterotrophic bioassay study.</description>
    <dc:title>The Matrix Stick-Breaking Process: Flexible Bayes Meta-Analysis</dc:title>

    <dc:creator>David Dunson</dc:creator>
    <dc:source>pp. 317-327.</dc:source>
    <dc:date>2008-03-21T22:39:53-00:00</dc:date>
    <prism:startingPage>317</prism:startingPage>
    <prism:endingPage>327</prism:endingPage>
    <prism:category>bayesian</prism:category>
    <prism:category>clustering</prism:category>
    <prism:category>dependent-partition</prism:category>
    <prism:category>dirichlet-process</prism:category>
    <prism:category>hierarchical</prism:category>
    <prism:category>matrix</prism:category>
    <prism:category>mixture-model</prism:category>
    <prism:category>nonparametric</prism:category>
    <prism:category>prior</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/2517325">
    <title>A Bayesian Model for Supervised Clustering with the Dirichlet Process Prior</title>
    <link>http://www.citeulike.org/user/mshafiei/article/2517325</link>
    <description>&lt;i&gt;J. Mach. Learn. Res., Vol. 6 (2005), pp. 1551-1577.&lt;/i&gt;</description>
    <dc:title>A Bayesian Model for Supervised Clustering with the Dirichlet Process Prior</dc:title>

    <dc:creator>Hal Iii</dc:creator>
    <dc:creator>Daniel Marcu</dc:creator>
    <dc:source>J. Mach. Learn. Res., Vol. 6 (2005), pp. 1551-1577.</dc:source>
    <dc:date>2008-03-12T01:37:16-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>J. Mach. Learn. Res.</prism:publicationName>
    <prism:issn>1533-7928</prism:issn>
    <prism:volume>6</prism:volume>
    <prism:startingPage>1551</prism:startingPage>
    <prism:endingPage>1577</prism:endingPage>
    <prism:publisher>MIT Press</prism:publisher>
    <prism:category>bayesian</prism:category>
    <prism:category>clustering</prism:category>
    <prism:category>conjugate</prism:category>
    <prism:category>crp</prism:category>
    <prism:category>mcmc</prism:category>
    <prism:category>non-conjugate</prism:category>
    <prism:category>nonparametric</prism:category>
    <prism:category>prior</prism:category>
    <prism:category>sampling</prism:category>
    <prism:category>supervised</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/2458674">
    <title>Model-based overlapping clustering</title>
    <link>http://www.citeulike.org/user/mshafiei/article/2458674</link>
    <description>&lt;i&gt;(2005), pp. 532-537.&lt;/i&gt;</description>
    <dc:title>Model-based overlapping clustering</dc:title>

    <dc:creator>Arindam Banerjee</dc:creator>
    <dc:creator>Chase Krumpelman</dc:creator>
    <dc:creator>Joydeep Ghosh</dc:creator>
    <dc:creator>Sugato Basu</dc:creator>
    <dc:creator>Raymond Mooney</dc:creator>
    <dc:identifier>doi:10.1145/1081870.1081932</dc:identifier>
    <dc:source>(2005), pp. 532-537.</dc:source>
    <dc:date>2008-03-02T23:01:46-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:startingPage>532</prism:startingPage>
    <prism:endingPage>537</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>clustering</prism:category>
    <prism:category>overlapping</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/1239722">
    <title>Bayesian hierarchical clustering</title>
    <link>http://www.citeulike.org/user/mshafiei/article/1239722</link>
    <description>&lt;i&gt;(2005), pp. 297-304.&lt;/i&gt;</description>
    <dc:title>Bayesian hierarchical clustering</dc:title>

    <dc:creator>Katherine Heller</dc:creator>
    <dc:creator>Zoubin Ghahramani</dc:creator>
    <dc:identifier>doi:10.1145/1102351.1102389</dc:identifier>
    <dc:source>(2005), pp. 297-304.</dc:source>
    <dc:date>2007-04-20T13:27:16-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:startingPage>297</prism:startingPage>
    <prism:endingPage>304</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>bayesian</prism:category>
    <prism:category>clustering</prism:category>
    <prism:category>dirichlet</prism:category>
    <prism:category>hierarchical</prism:category>
    <prism:category>mixture</prism:category>
    <prism:category>models</prism:category>
    <prism:category>process</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/2304494">
    <title>A probabilistic framework for relational clustering</title>
    <link>http://www.citeulike.org/user/mshafiei/article/2304494</link>
    <description>&lt;i&gt;(2007), pp. 470-479.&lt;/i&gt;</description>
    <dc:title>A probabilistic framework for relational clustering</dc:title>

    <dc:creator>Bo Long</dc:creator>
    <dc:creator>Zhongfei Zhang</dc:creator>
    <dc:creator>Philip Yu</dc:creator>
    <dc:identifier>doi:10.1145/1281192.1281244</dc:identifier>
    <dc:source>(2007), pp. 470-479.</dc:source>
    <dc:date>2008-01-29T16:35:34-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:startingPage>470</prism:startingPage>
    <prism:endingPage>479</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>clustering</prism:category>
    <prism:category>network-analysis</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/1983303">
    <title>A Nonparametric Bayesian Approach to Modeling Overlapping Clusters</title>
    <link>http://www.citeulike.org/user/mshafiei/article/1983303</link>
    <description>&lt;i&gt;(2007)&lt;/i&gt;</description>
    <dc:title>A Nonparametric Bayesian Approach to Modeling Overlapping Clusters</dc:title>

    <dc:creator>KA Heller</dc:creator>
    <dc:creator>Z Ghahramani</dc:creator>
    <dc:source>(2007)</dc:source>
    <dc:date>2007-11-26T03:17:47-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:category>bayesian</prism:category>
    <prism:category>clustering</prism:category>
    <prism:category>non-parametric</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/1952481">
    <title>Sharing Clusters among Related Groups: Hierarchical Dirichlet Processes</title>
    <link>http://www.citeulike.org/user/mshafiei/article/1952481</link>
    <description>&lt;i&gt;(2004)&lt;/i&gt;</description>
    <dc:title>Sharing Clusters among Related Groups: Hierarchical Dirichlet Processes</dc:title>

    <dc:creator>YW Teh</dc:creator>
    <dc:creator>MI Jordan</dc:creator>
    <dc:creator>MJ Beal</dc:creator>
    <dc:creator>DM Blei</dc:creator>
    <dc:source>(2004)</dc:source>
    <dc:date>2007-11-21T15:18:40-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:category>bayesian</prism:category>
    <prism:category>clustering</prism:category>
    <prism:category>dirichlet</prism:category>
    <prism:category>non-parametric</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/965794">
    <title>Hierarchical Dirichlet Processes</title>
    <link>http://www.citeulike.org/user/mshafiei/article/965794</link>
    <description>&lt;i&gt;Journal of the American Statistical Association, Vol. 101, No. 476. (December 2006), pp. 1566-1581.&lt;/i&gt;</description>
    <dc:title>Hierarchical Dirichlet Processes</dc:title>

    <dc:creator>Teh</dc:creator>
    <dc:creator>Yee Whye</dc:creator>
    <dc:creator>Jordan</dc:creator>
    <dc:creator>I Michael</dc:creator>
    <dc:creator>Beal</dc:creator>
    <dc:creator>J Matthew</dc:creator>
    <dc:creator>Blei</dc:creator>
    <dc:creator>M David</dc:creator>
    <dc:identifier>doi:10.1198/016214506000000302</dc:identifier>
    <dc:source>Journal of the American Statistical Association, Vol. 101, No. 476. (December 2006), pp. 1566-1581.</dc:source>
    <dc:date>2006-11-29T01:37:01-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Journal of the American Statistical Association</prism:publicationName>
    <prism:issn>0162-1459</prism:issn>
    <prism:volume>101</prism:volume>
    <prism:number>476</prism:number>
    <prism:startingPage>1566</prism:startingPage>
    <prism:endingPage>1581</prism:endingPage>
    <prism:publisher>American Statistical Association</prism:publisher>
    <prism:category>bayesian</prism:category>
    <prism:category>clustering</prism:category>
    <prism:category>dirichlet</prism:category>
    <prism:category>nonparametric</prism:category>
</item>



</rdf:RDF>

