<?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>Thu, 21 Aug 2008 15:23:38 BST</pubDate>


	<title>CiteULike: bigbossman's streams</title>
	<description>CiteULike: bigbossman's streams</description>


	<link>http://www.citeulike.org/user/bigbossman/tag/streams</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/bigbossman/article/1511921"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/1469541"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/1198518"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/1369090"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/1015219"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bigbossman/article/1126986"/>

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


<item rdf:about="http://www.citeulike.org/user/bigbossman/article/1511921">
    <title>Detecting buzz from time-sequenced document streams</title>
    <link>http://www.citeulike.org/user/bigbossman/article/1511921</link>
    <description>&lt;i&gt;e-Technology, e-Commerce and e-Service, 2005. EEE '05. Proceedings. The 2005 IEEE International Conference on (2005), pp. 347-352.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper presents a formal method of detecting emerging and changing interests that appear in document streams arriving continuously over time. Examples of such document streams include email, news articles, and Web logs (or blogs). We utilize the temporal information associated with documents in the streams and discover emerging issues and topics of interest and their change by detecting buzzwords in the documents. Buzzwords are terms that occur with strong momentum for a relatively short period of time. Our approach for buzz detection is based on the notion of &#34;burst of activities&#34; proposed by Kleinberg [2002]. The burst of activities is modeled using a weighted automaton. We propose an algorithm to discover buzzwords of high intensity measured by their momentum and relative duration of the bursts. The method is applied and validated on a stream of blog postings and we report the experiment results.</description>
    <dc:title>Detecting buzz from time-sequenced document streams</dc:title>

    <dc:creator>Jeonghee Yi</dc:creator>
    <dc:source>e-Technology, e-Commerce and e-Service, 2005. EEE '05. Proceedings. The 2005 IEEE International Conference on (2005), pp. 347-352.</dc:source>
    <dc:date>2007-07-29T19:40:04-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>e-Technology, e-Commerce and e-Service, 2005. EEE '05. Proceedings. The 2005 IEEE International Conference on</prism:publicationName>
    <prism:startingPage>347</prism:startingPage>
    <prism:endingPage>352</prism:endingPage>
    <prism:category>burst</prism:category>
    <prism:category>buzz</prism:category>
    <prism:category>document</prism:category>
    <prism:category>streams</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bigbossman/article/1469541">
    <title>Efficient elastic burst detection in data streams</title>
    <link>http://www.citeulike.org/user/bigbossman/article/1469541</link>
    <description>&lt;i&gt;(2003)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to monitor many sliding window sizes simultaneously and to report those windows with aggregates significantly di#erent from other periods. We will present a general data structure for detecting interesting aggregates over such elastic windows in near linear time. We present applications of the algorithm for detecting Gamma...</description>
    <dc:title>Efficient elastic burst detection in data streams</dc:title>

    <dc:creator>Y Zhu</dc:creator>
    <dc:creator>D Shasha</dc:creator>
    <dc:source>(2003)</dc:source>
    <dc:date>2007-07-20T14:28:29-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:category>burst</prism:category>
    <prism:category>data</prism:category>
    <prism:category>detection</prism:category>
    <prism:category>streams</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bigbossman/article/1198518">
    <title>High-performance complex event processing over streams</title>
    <link>http://www.citeulike.org/user/bigbossman/article/1198518</link>
    <description>&lt;i&gt;(2006), pp. 407-418.&lt;/i&gt;</description>
    <dc:title>High-performance complex event processing over streams</dc:title>

    <dc:creator>Eugene Wu</dc:creator>
    <dc:creator>Yanlei Diao</dc:creator>
    <dc:creator>Shariq Rizvi</dc:creator>
    <dc:identifier>doi:10.1145/1142473.1142520</dc:identifier>
    <dc:source>(2006), pp. 407-418.</dc:source>
    <dc:date>2007-03-30T15:49:20-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:startingPage>407</prism:startingPage>
    <prism:endingPage>418</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>complex</prism:category>
    <prism:category>event</prism:category>
    <prism:category>processing</prism:category>
    <prism:category>streams</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bigbossman/article/1369090">
    <title>SVP: A Model Capturing Sets, Lists, Streams, and Parallelism</title>
    <link>http://www.citeulike.org/user/bigbossman/article/1369090</link>
    <description>&lt;i&gt;(1992), pp. 115-126.&lt;/i&gt;</description>
    <dc:title>SVP: A Model Capturing Sets, Lists, Streams, and Parallelism</dc:title>

    <dc:creator>Douglas Parker</dc:creator>
    <dc:creator>Eric Simon</dc:creator>
    <dc:creator>Patrick Valduriez</dc:creator>
    <dc:source>(1992), pp. 115-126.</dc:source>
    <dc:date>2007-06-06T22:13:16-00:00</dc:date>
    <prism:publicationYear>1992</prism:publicationYear>
    <prism:startingPage>115</prism:startingPage>
    <prism:endingPage>126</prism:endingPage>
    <prism:publisher>Morgan Kaufmann Publishers Inc.</prism:publisher>
    <prism:category>lists</prism:category>
    <prism:category>sets</prism:category>
    <prism:category>streams</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bigbossman/article/1015219">
    <title>Range Counting over Multidimensional Data Streams</title>
    <link>http://www.citeulike.org/user/bigbossman/article/1015219</link>
    <description>&lt;i&gt;Discrete &#38; Computational Geometry, Vol. 36, No. 4. (December 2006), pp. 633-655.&lt;/i&gt;</description>
    <dc:title>Range Counting over Multidimensional Data Streams</dc:title>

    <dc:creator>Suri</dc:creator>
    <dc:creator>Subhash</dc:creator>
    <dc:creator>Toth</dc:creator>
    <dc:creator>D Csaba</dc:creator>
    <dc:creator>Zhou</dc:creator>
    <dc:creator>Yunhong</dc:creator>
    <dc:identifier>doi:10.1007/s00454-006-1269-4</dc:identifier>
    <dc:source>Discrete &#38; Computational Geometry, Vol. 36, No. 4. (December 2006), pp. 633-655.</dc:source>
    <dc:date>2006-12-26T17:24:17-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Discrete &#38; Computational Geometry</prism:publicationName>
    <prism:issn>0179-5376</prism:issn>
    <prism:volume>36</prism:volume>
    <prism:number>4</prism:number>
    <prism:startingPage>633</prism:startingPage>
    <prism:endingPage>655</prism:endingPage>
    <prism:publisher>Springer</prism:publisher>
    <prism:category>data</prism:category>
    <prism:category>streams</prism:category>
    <prism:category>summary</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bigbossman/article/1126986">
    <title>Bursty and Hierarchical Structure in Streams</title>
    <link>http://www.citeulike.org/user/bigbossman/article/1126986</link>
    <description>&lt;i&gt;Data Mining and Knowledge Discovery, Vol. V7, No. 4. (1 October 2003), pp. 373-397.&lt;/i&gt;</description>
    <dc:title>Bursty and Hierarchical Structure in Streams</dc:title>

    <dc:creator>Jon Kleinberg</dc:creator>
    <dc:identifier>doi:10.1023/A:1024940629314</dc:identifier>
    <dc:source>Data Mining and Knowledge Discovery, Vol. V7, No. 4. (1 October 2003), pp. 373-397.</dc:source>
    <dc:date>2007-02-27T11:50:48-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:publicationName>Data Mining and Knowledge Discovery</prism:publicationName>
    <prism:volume>V7</prism:volume>
    <prism:number>4</prism:number>
    <prism:startingPage>373</prism:startingPage>
    <prism:endingPage>397</prism:endingPage>
    <prism:category>burst</prism:category>
    <prism:category>streams</prism:category>
    <prism:category>textmining</prism:category>
</item>



</rdf:RDF>

