BloJJ

Adventures of a multidimensional freak

This is Juan Julián Merelo Guervós English-language blog. He teaches computer science at the University of Granada, in southern Spain. Come back here to read about politics, technology, with a new twist

Latest comments

  • Mumbai Escorts en The Real H
  • Mumbai Escorts en What is informal distributed evolutionary computation?
  • Mumbai Escorts en What is informal distributed evolutionary computation?
  • Mumbai Escorts en Cloning part of a local repository
  • Mumbai Escorts en Paper on the Evolutionary Computation coauthorship network uploaded to ArXiV
  • seomaster en About conference poster design and defense
  • ALI en Paper on the Evolutionary Computation coauthorship network uploaded to ArXiV
  • ALI en Cloning part of a local repository
  • ALI en Paper on the Evolutionary Computation coauthorship network uploaded to ArXiV
  • ALI en Cloning part of a local repository
  • Blogs Out There

    Nelson Minar's Blog
    Jeremy Zawodny's Blog
    Kottke
    Complexes, Carlos Gershenson's blog
    IlliGAL, Genetic Algorithms blog
    Blogging in the wind, Víctor R. Ruiz's blog


    Atalaya, my Spanish language blog
    Geneura@Wordpress, our research group's blog.
    My home page

    Old stories


    Creative Commons License
    This work is licensed under a Creative Commons License.
    Blogalia

    Stats
    Inicio > Historias > Automatic detection of trends in time-stamped sequences: an evolutionary approach available online

    Automatic detection of trends in time-stamped sequences: an evolutionary approach available online

    Our last paper on modelling time streams such as the streams of comments to this site, Blogalia, which I have coauthored with Dr. Lourdes Araújo,is available online. From the abstract:
    This paper presents an evolutionary algorithm for modeling the arrival dates in time-stamped data sequences such as newscasts, e-mails, IRC conversations, scientific journal articles or weblog postings. These models are applied to the detection of buzz (i.e. terms that occur with a higher-than-normal frequency) in them, which has attracted a lot of interest in the online world with the increasing number of periodic content producers. That is why in this paper we have used this kind of online sequences to test our system, though it is also valid for other types of event sequences. The algorithm assigns frequencies (number of events per time unit) to time intervals so that it produces an optimal fit to the data. The optimization procedure is a trade off between accurately fitting the data and avoiding too many frequency changes, thus overcoming the noise inherent in these sequences. This process has been traditionally performed using dynamic programming algorithms, which are limited by memory and efficiency requirements. This limitation can be a problem when dealing with long sequences, and suggests the application of alternative search methods with some degree of uncertainty to achieve tractability, such as the evolutionary algorithm proposed in this paper. This algorithm is able to reach the same solution quality as those classical dynamic programming algorithms, but in a shorter time. We also test different cost functions and propose a new one that yields better fits than the one originally proposed by Kleinberg on real-world data. Finally, several distributions of states for the finite state automata are tested, with the result that an uniform distribution produces much better fits than the geometric distribution also proposed by Kleinberg. We also present a variant of the evolutionary algorithm, which achieves a fast fit of a sequence extended with new data, by taking advantage of the fit obtained for the original subsequence.

    If Springerlink is not available in your institution, please email me for a copy. It's been really a long time from the initial version, with 3 revisions (and even more if you include the versions that were sent, and rejected, from other journals), but finally it's been published. Now, on to the next one...

    Etiquetas: , , ,

    2009-03-18 09:54 | 7 Comment(s) | Filed in Research

    Referencias (TrackBacks)

    URL de trackback de esta historia http://blojj.blogalia.com//trackbacks/62347

    Comentarios

    1
    De: happy wheels Fecha: 2018-06-18 11:37

    I have been seeking information on this topic for the past few hours and found your post to be well written and has solid information. Thank you!
    happy wheels



    2
    De: Amelie Jack Fecha: 2018-07-19 11:59

    Modern Illustrators has a team of web designers ready to create your new website or redesign your existing site. We provide website design services nationwide.

    website design service



    3
    De: http://www.poker18dewa.com Fecha: 2018-08-26 10:28

    One more thing. In my opinion that there are many travel insurance web sites of reputable companies than enable you to enter your holiday details and have you the quotes. You can also purchase the actual international travel insurance policy on-line by using your credit card. All that you should do will be to enter your current travel specifics and you can see the plans side-by-side. Simply find the package that suits your capacity to pay and needs after which use your bank credit card to buy the idea. Travel insurance on the web is a good way to start looking for a respectable company to get international travel cover. Thanks for expressing your ideas. http://www.poker18dewa.com



    4
    De: hansara911 Fecha: 2018-10-02 10:57

    I like to get up early to go out and breathe fresh air. I feel that it is good for health and a good habit
    Return Man 3



    5
    De: www.robloxrobuxonline.com/ Fecha: 2018-10-29 07:25

    Great post.



    6
    De: happy wheels Fecha: 2018-10-29 10:11

    Happy Wheels - one of the most interactive games and the most played online free web browser based game of all time.



    7
    De: Riza Fecha: 2018-10-29 10:12

    Thank you very much. I think a lot of people are looking for such a content from you. hope you will have more share such like that.
    happy wheels



    Nombre
    Correo-e
    URL
    Dirección IP: 54.82.93.116 (978362079e)
    Comentario
    ¿Cuánto es: diez mil + uno?

    © 2002 - 2008 jmerelo
    Powered by Blogalia