Size matters: Finding the most informative set of window lengths

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7524 LNAI, Issue PART 2, 2012, Pages 451-466

  Lijffijt, Jefrey ^a   Papapetrou, Panagiotis ^a,b   Puolamäki, Kai ^a  

^a AALTO UNIVERSITY   (Finland)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

clustering; event sequence; exploratory data mining; window length

Indexed keywords

BURSTINESS; CLUSTERING; DISCRETE EVENTS; EVENT SEQUENCE; EXPLORATORY DATA MINING; OPTIMAL SETS; STRUCTURAL BEHAVIORS; SYNTHETIC DATA; TWO DOMAINS;

GRAPHICAL USER INTERFACES; LEARNING SYSTEMS;

PROBLEM SOLVING;

EID: 84866846519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33486-3_29     Document Type: Conference Paper

References (32)

1. Altmann, E.G., Pierrehumbert, J.B., Motter, A.E.: Beyond word frequency: Bursts, lulls, and scaling in the temporal distributions of words. PLoS ONE 4(11), e7678 (2009)
2. Benson, G.: Tandem repeats finder: a program to analyze dna sequences. Nucleic Acids Research 27(2), 573-580 (1999)
3. Biber, D.: Variation across speech and writing. Cambridge University Press (1988)
4. Bourgain, C., Genin, E., Quesneville, H., Clerget-Daproux, F.: Search for multifactorial disease susceptibility genes in founder populations. Annals of Human Genetics 64(03), 255-265 (2000)
5. Calders, T., Dexters, N., Goethals, B.: Mining frequent items in a stream using flexible windows. Intelligent Data Analysis 12(3), 293-304 (2008)
6. Chiu, B., Keogh, E., Lonardi, S.: Probabilistic discovery of time series motifs. In: Proc. of ACM SIGKDD, pp. 493-498 (2003)
7. Das, M.K., Dai, H.-K.: A survey of DNA motif finding algorithms. BMC Bioinformatics 8(suppl. 7), S21 (2007)
8. Demaine, E.D., López-Ortiz, A., Munro, J.I.: Frequency Estimation of Internet Packet Streams with Limited Space. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 348-360. Springer, Heidelberg (2002)
9. Evert, S.: How random is a corpus? the library metaphor. Zeitschrift für Anglistik und Amerikanistik 54(2), 177-190 (2006)
10. Forsyth, D., Ponce, J.: Computer Vision: A Modern Approach. Prentice Hall (2011)
11. Gentles, A.J., Karlin, S.: Genome-scale compositional comparisons in eukaryotes. Genome Research 11(4), 540-546 (2001)
12. Giannella, C., Han, E.R.J., Liu, C.: Mining frequent itemsets over arbitrary time intervals in data streams. Technical Report TR587 (2003)
13. Golab, L., López-Ortiz, A., Dehaan, D., Munro, J.I.: Identifying frequent items in sliding windows over on-line packet streams. In: Proc. of IMC, pp. 173-178 (2003)
14. Gries, S.T.: Dispersions and adjusted frequencies in corpora. International Journal of Corpus Linguistics 13(4), 403-437 (2008)
15. Jin, L., Chai, D.J., Lee, Y.K., Ryu, K.H.: Mining frequent itemsets over data streams with multiple time-sensitive sliding windows. In: Proc. of ALPIT, pp. 486-491 (2007)
16. Jin, R., Agrawal, G.: An algorithm for in-core frequent itemset mining on streaming data. In: Proc. of IEEE ICDM, pp. 210-217 (2005)
17. Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28(1), 51-55 (2003)
18. Katz, S.M.: Distribution of content words and phrases in text and language modelling. Natural Language Engineering 2(1), 15-59 (1996)
19. Kirkness, E.F., Bafna, V., Halpern, A.L., Levy, S., Remington, K., Rusch, D.B., Delcher, A.L., Pop, M., Wang, W., Fraser, C.M., Venter, J.C.: The dog genome: survey sequencing and comparative analysis. Science 301(5641), 1898-1903 (2003)
20. Lee, D., Lee, W.: Finding maximal frequent itemsets over online data streams adaptively. In: Proc. of IEEE ICDM, pp. 266-273 (2005)
21. Li, C., Wang, B., Yang, X.: Vgram: improving performance of approximate queries on string collections using variable-length grams. In: Proc. of VLDB, pp. 303-314 (2007)
22. Li, Y., Sung,W.-K., Liu, J.J.: Association mapping via regularized regression analysis of single-nucleotidepolymorphism haplotypes in variable-sized sliding windows. The American Journal of Human Genetics 80(4), 705-715 (2007)
23. Lijffijt, J., Papapetrou, P., Puolamäki, K., Mannila, H.: Analyzing Word Frequencies in Large Text Corpora Using Inter-arrival Times and Bootstrapping. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011, Part II. LNCS, vol. 6912, pp. 341-357. Springer, Heidelberg (2011)
24. Madsen, R.E., Kauchak, D., Elkan, C.: Modeling word burstiness using the dirichlet distribution. In: Proc. of ICML, pp. 545-552 (2005)
25. Mannila, H., Toivonen, H., Inkeri Verkamo, A.: Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov. 1(3), 259-289 (1997)
26. Mathias, R., Gao, P., Goldstein, J., Wilson, A., Pugh, E., Furbert-Harris, P., Dunston, G., Malveaux, F., Togias, A., Barnes, K., Beaty, T., Huang, S.-K.: A graphical assessment of p-values from sliding window haplotype tests of association to identify asthma susceptibility loci on chromosome 11q. BMC Genetics 7(1) (2006)
27. Mueen, A., Keogh, E.J., Zhu, Q., Cash, S., Westover, B.: Exact discovery of time series motifs. In: Proc. of SIAM SDM (2009)
28. Papadimitriou, S., Yu, P.: Optimal multi-scale patterns in time series streams. In: Proc. of ACM SIGMOD, pp. 647-658 (2006)
29. Papapetrou, P., Benson, G., Kollios, G.: Discovering frequent poly-regions in dna sequences. In: Proc. of IEEE ICDM Workshops, pp. 94-98 (2006)
30. Sörnmo, L., Laguna, P.: Bioelectrical Signal Processing in Cardiac and Neurological Applications. Elsevier Academic Press (2005)
31. Tang, R., Feng, T., Sha, Q., Zhang, S.: A variable-sized sliding-window approach for genetic association studies via principal component analysis. Annals of Human Genetics 73(Pt 6), 631-637 (2009)
32. Toivonen, H., Onkamo, P., Vasko, K., Ollikainen, V., Sevon, P., Mannila, H., Herr, M., Kere, J.: Data mining applied to linkage disequilibrium mapping. Am. J. Hum. Genet. 67, 133-145 (2000)