<?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 17:12:10 BST</pubDate>


	<title>CiteULike: pdlug Zhou</title>
	<description>CiteULike: pdlug Zhou</description>


	<link>http://www.citeulike.org/user/pdlug/author/Zhou</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/pdlug/article/2841716"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/pdlug/article/2836378"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/pdlug/article/2774250"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/pdlug/article/1392108"/>

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


<item rdf:about="http://www.citeulike.org/user/pdlug/article/2841716">
    <title>Ultra accurate personal recommendation via eliminating redundant correlations</title>
    <link>http://www.citeulike.org/user/pdlug/article/2841716</link>
    <description>&lt;i&gt;(27 May 2008)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In this paper, based on a weighted projection of bipartite user-object network, we introduce a personal recommendation algorithm which has remarkably higher accuracy than the classical algorithm, namely collaborative filtering. In this algorithm, the correlation resulting from a specific attribute may be repeatedly counted in the cumulative recommendations from different objects. By considering the higher order correlations, we design an effective algorithm that can, to some extent, eliminate the redundant correlations. The algorithmic accuracy, measured by the ranking score, can be further improved by 23% in the optimal case. Most of the previous studies considered the algorithmic accuracy only, in this paper, we argue that the diversity and popularity, as two significant criteria of algorithmic performance, should also be taken into account. With more or less the same accuracy, an algorithm giving higher diversity and lower popularity is more favorable. Numerical results show that the present algorithm can outperform the standard one simultaneously in all three criteria: higher accuracy, higher diversity, and lower popularity.</description>
    <dc:title>Ultra accurate personal recommendation via eliminating redundant correlations</dc:title>

    <dc:creator>Tao Zhou</dc:creator>
    <dc:creator>Riqi Su</dc:creator>
    <dc:creator>Runran Liu</dc:creator>
    <dc:creator>Luoluo Jiang</dc:creator>
    <dc:creator>Bing-Hong Wang</dc:creator>
    <dc:creator>Yi-Cheng Zhang</dc:creator>
    <dc:source>(27 May 2008)</dc:source>
    <dc:date>2008-05-28T14:54:51-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:category>collaborative</prism:category>
    <prism:category>collaborative-filtering</prism:category>
    <prism:category>filtering</prism:category>
    <prism:category>recommendation</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/pdlug/article/2836378">
    <title>On the probability distribution of stock returns in the Mike-Farmer model</title>
    <link>http://www.citeulike.org/user/pdlug/article/2836378</link>
    <description>&lt;i&gt;(23 May 2008)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Recently, Mike and Farmer have constructed a very powerful and realistic behavioral model to mimick the dynamic process of stock price formation based on the empirical regularities of order placement and cancelation in a purely order-driven market, which can successfully reproduce the whole distribution of returns, not only the well-known power-law tails, together with several other important stylized facts. There are three key ingredients in the Mike-Farmer (MF) model: the long memory of order signs characterized by the Hurst index $H_s$, the distribution of relative order prices $x$ in reference to the same best price described by a Student distribution (or Tsallis' $q$-Gaussian), and the dynamics of order cancelation. They showed that different values of the Hurst index $H_s$ and the freedom degree $&#945;_x$ of the Student distribution can always produce power-law tails in the return distribution $f(r)$ with different tail exponent $&#945;_r$. In this paper, we study the origin of the power-law tails of the return distribution $f(r)$ in the MF model, based on extensive simulations with different combinations of the left part $f_L(x)$ for $x&#60;0$ and the right part $f_R(x)$ for $x&#62;0$ of $f(x)$. We find that power-law tails appear only when $f_L(x)$ has a power-law tail, no matter $f_R(x)$ has a power-law tail or not. In addition, we find that the distributions of returns in the MF model at different timescales can be well modeled by the Student distributions, whose tail exponents are close to the well-known cubic law and increase with the timescale.</description>
    <dc:title>On the probability distribution of stock returns in the Mike-Farmer model</dc:title>

    <dc:creator>Gao-Feng Gu</dc:creator>
    <dc:creator>Wei-Xing Zhou</dc:creator>
    <dc:source>(23 May 2008)</dc:source>
    <dc:date>2008-05-27T02:34:16-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:category>asset</prism:category>
    <prism:category>economics</prism:category>
    <prism:category>finance</prism:category>
    <prism:category>market</prism:category>
    <prism:category>probability</prism:category>
    <prism:category>stock</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/pdlug/article/2774250">
    <title>Learning Multiple Graphs for Document Recommendations</title>
    <link>http://www.citeulike.org/user/pdlug/article/2774250</link>
    <description>&lt;i&gt;(21 April 2008)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The Web offers rich relational data with different semantics. In this paper, we address the problem of document recommendation in a digital library, where the documents in question are networked by citations and are associated with other entities by various relations. Due to the sparsity of a single graph and noise in graph construction, we propose a new method for combining multiple graphs to measure document similarities, where different factorization strategies are used based on the nature of different graphs. In particular, the new method seeks a single low-dimensional embedding of documents that captures their relative similarities in a latent space. Based on the obtained embedding, a new recommendation framework is developed using semi-supervised learning on graphs. In addition, we address the scalability issue and propose an incremental algorithm. The new incremental method significantly improves the efficiency by calculating the embedding for new incoming documents only. The new batch and incremental methods are evaluated on two real world datasets prepared from CiteSeer. Experiments demonstrate significant quality improvement for our batch method and significant efficiency improvement with tolerable quality loss for our incremental method.</description>
    <dc:title>Learning Multiple Graphs for Document Recommendations</dc:title>

    <dc:creator>Ding Zhou</dc:creator>
    <dc:creator>Shenghuo Zhu</dc:creator>
    <dc:creator>Kai Yu</dc:creator>
    <dc:creator>Xiaodan Song</dc:creator>
    <dc:creator>Belle Tseng</dc:creator>
    <dc:creator>Hongyuan Zha</dc:creator>
    <dc:creator>Lee Giles(</dc:creator>
    <dc:source>(21 April 2008)</dc:source>
    <dc:date>2008-05-09T04:14:29-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:category>graph</prism:category>
    <prism:category>learning</prism:category>
    <prism:category>machine-learning</prism:category>
    <prism:category>network</prism:category>
    <prism:category>recommendation</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/pdlug/article/1392108">
    <title>Multifractality in stock indexes: Fact or fiction?</title>
    <link>http://www.citeulike.org/user/pdlug/article/1392108</link>
    <description>&lt;i&gt;(14 Jun 2007)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Multifractal analysis and extensive statistical tests are performed upon intraday minutely data within individual trading days for four stock market indexes (including HSI, SZSC, S&#38;P500, and NASDAQ) to check whether the indexes (instead of the returns) possess multifractality. We find that the mass exponent $&#964;(q)$ is linear and the singularity $&#945;(q)$ is close to 1 for all trading days and all indexes. Furthermore, we find strong evidence showing that the scaling behaviors of the original data sets cannot be distinguished from those of the shuffled time series. Hence, the so-called multifractality in the intraday stock market indexes is merely an illusion.</description>
    <dc:title>Multifractality in stock indexes: Fact or fiction?</dc:title>

    <dc:creator>Zhi-Qiang Jiang</dc:creator>
    <dc:creator>Wei-Xing Zhou</dc:creator>
    <dc:source>(14 Jun 2007)</dc:source>
    <dc:date>2007-06-15T14:56:32-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:category>economics</prism:category>
    <prism:category>finance</prism:category>
    <prism:category>fractal</prism:category>
    <prism:category>markets</prism:category>
    <prism:category>stock</prism:category>
</item>



</rdf:RDF>

