9,990 Hits in 3.7 sec

Efficient Query Processing in Time Series

Yuhong Li
2015 Proceedings of the 2015 ACM SIGMOD on PhD Symposium - SIGMOD '15 PhD Symposium  
Specifically, two types of extraction queries are discussed in this work, including longest-lasting correlated subsequence query and time series motif query.  ...  With the rapid development over the last decade, time series data become one of the most frequently used data in real world applications (e.g., finance analysis, medical diagnosis, environmental monitoring  ...  In particular, longest-lasting correlation focus on discovering longest-lasting highly correlated subsequence in massive time series databases, and it is particularly useful in helping those analyses without  ... 
doi:10.1145/2744680.2744688 dblp:conf/sigmod/Li15 fatcat:ranl2rquurf2rbc5shoxg4kjhu

Discovering longest-lasting correlation in sequence databases

Yuhong Li, Leong Hou U, Man Lung Yiu, Zhiguo Gong
2013 Proceedings of the VLDB Endowment  
In this work we focus on discovering longest-lasting highly correlated subsequences in sequence databases, which is particularly useful in helping those analyses without prior knowledge about the query  ...  Most existing work on sequence databases use correlation (e.g., Euclidean distance and Pearson correlation) as a core function for various analytical tasks.  ...  CONCLUSION In this paper, we propose a novel technique which can efficiently discover longest-lasting correlated subsequences in sequence database.  ... 
doi:10.14778/2556549.2556552 fatcat:zl3ga5it3vfudnryzgf3qc73gq

Discovering significant OPSM subspace clusters in massive gene expression data

Byron J. Gao, Obi L. Griffith, Martin Ester, Steven J. M. Jones
2006 Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '06  
OPSM mining is reducible to a special case of the sequential pattern mining problem, in which a pattern and its supporting sequences uniquely specify an OPSM cluster.  ...  In an OPSM, the expression levels of all genes induce the same linear ordering of the conditions.  ...  LoPad : longest pattern discovery.  ... 
doi:10.1145/1150402.1150529 dblp:conf/kdd/GaoGEJ06 fatcat:xmpddsajejdz7huttdgsfzpqyy

Finding maximum-length repeating patterns in music databases

Ioannis Karydis, Alexandros Nanopoulos, Yannis Manolopoulos
2006 Multimedia tools and applications  
This paper introduces the problem of discovering maximum-length repeating patterns in music objects.  ...  A novel algorithm is presented for the extraction of this kind of patterns from a melody music object.  ...  Briefly, the key points of these differences are that approaches for long itemsets mining focus on large, diskresident itemset databases while for the discovery of the longest repeating patterns, music  ... 
doi:10.1007/s11042-006-0068-5 fatcat:raljzv7m3jdt5ixag7kyv5szhi

Machine Learning Assisted Design of Highly Active Peptides for Drug Discovery

Sébastien Giguère, François Laviolette, Mario Marchand, Denise Tremblay, Sylvain Moineau, Xinxia Liang, Éric Biron, Jacques Corbeil, Philip M. Kim
2015 PLoS Computational Biology  
Finally, we validated the proposed approach in vitro with the discovery of new cationic antimicrobial peptides.  ...  Hence, it makes sense to automate this chemical exploration endeavor in a wise, informed, and efficient fashion.  ...  Machine Learning Assisted Design of Highly Active Peptides  ... 
doi:10.1371/journal.pcbi.1004074 pmid:25849257 pmcid:PMC4388847 fatcat:vqrieh44wncx5j45rnlpeoirvy

A survey of temporal knowledge discovery paradigms and methods

J.F. Roddick, M. Spiliopoulou
2002 IEEE Transactions on Knowledge and Data Engineering  
At the same time, interest in temporal databases has been increasing and a growing number of both prototype and implemented systems are using an enhanced temporal understanding to explain aspects of behavior  ...  AbstractÐWith the increase in the size of data sets, data mining has recently become an important research topic and is receiving substantial interest from both academia and industry.  ...  ACKNOWLEDGMENTS This work was conceived while the authors attended the Integrating Spatial and Temporal Databases Workshop at Schloss Dagstuhl in November 1998.  ... 
doi:10.1109/tkde.2002.1019212 fatcat:vcofptm3i5aozake7s35w2pbde

A stock recommendation system exploiting rule discovery in stock databases

You-Min Ha, Sanghyun Park, Sang-Wook Kim, Jung-Im Won, Jee-Hee Yoon
2009 Information and Software Technology  
This paper addresses an approach that recommends investment types to stock investors by discovering useful rules from past changing patterns of stock prices in databases.  ...  For efficient discovery and matching of rules, we propose methods for discovering frequent patterns, constructing a frequent pattern base, and its indexing.  ...  A common feature of the prior methods proposed in a database community is to find both the heads and the bodies of rules in a rule discovery process.  ... 
doi:10.1016/j.infsof.2008.06.004 fatcat:rvwnkqxitjaphgclezypzo3mce

A survey of temporal data mining

Srivatsan Laxman, P. S. Sastry
2006 Sadhana (Bangalore)  
Over the last decade many interesting techniques of temporal data mining were proposed and shown to be useful in many applications.  ...  In this article, we present an overview of techniques of temporal data mining. We mainly concentrate on algorithms for pattern discovery in sequential data streams.  ...  The algorithms by Agrawal & Srikant (1995) need as many database passes as the length of the longest sequential pattern.  ... 
doi:10.1007/bf02719780 fatcat:nqyjuthpmreclhj4lygqyxxmk4

Improved user Navigation Pattern Prediction Technique from Web Log Data

V. Sujatha, Punithavalli
2012 Procedia Engineering  
Web Usage Mining (WUM) is the automatic discovery of user access pattern from web servers.  ...  Organizations collect large volumes of data in their daily operations, generated automatically by web servers and collected in server access logs.  ...  The main aim of LCS is to find the longest subsequence common to all sequences in a set of sequences. This method is discussed in this section. The algorithm works with two features.  ... 
doi:10.1016/j.proeng.2012.01.838 fatcat:bxnkph5u2bdgvpccac5hnjq3mq

Mitochondrial Inverted Repeats Strongly Correlate with Lifespan: mtDNA Inversions and Aging

Jiang-Nan Yang, Andrei Seluanov, Vera Gorbunova, Janine Santos
2013 PLoS ONE  
Mitochondrial defects are implicated in aging and in a multitude of age-related diseases, such as cancer, heart failure, Parkinson's disease, and Huntington's disease.  ...  Here we report a stronger correlation (Pearson's r = 20.55, p,10 -16 ; Spearman's r = 20.52, p,10 -14 ) between mitochondrial inverted repeats (IRs) and lifespan across 202 species of mammals.  ...  of 529) that had both mitochondrial genome reference sequences in NCBI and lifespan information in AnAge database [28] as of March 1, 2012.  ... 
doi:10.1371/journal.pone.0073318 pmid:24069185 pmcid:PMC3775743 fatcat:dnx5nzprlzhvlbyhpd53gwrkci

Subsequence matching on structured time series data

Huanmei Wu, Betty Salzberg, Gregory C Sharp, Steve B Jiang, Hiroki Shirato, David Kaeli
2005 Proceedings of the 2005 ACM SIGMOD international conference on Management of data - SIGMOD '05  
Subsequence matching in time series databases is a useful technique, with applications in pattern matching, prediction, and rule discovery.  ...  The matching results are analyzed and applied for motion prediction and correlation discovery.  ...  ACKNOWLEDGEMENT This work was supported in part by NSF grant IIS-0073063, the Whitaker Foundation Grant RG-01-0175, and CenSSIS, the Center of Subsurface Sensing and Imaging Systems, under the Engineering  ... 
doi:10.1145/1066157.1066235 dblp:conf/sigmod/WuSSJSK05 fatcat:74gxldc64zbqrlg2cu44zsjrzu

Automatically Discovering Unknown Short Video Repeats

Xianfeng Yang, Ping Xue, Qi Tian
2007 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07  
In this paper we propose an efficient and robust method to automatically discover unknown short video repeats with arbitrary lengths, from a few seconds to a few minutes, from large video databases or  ...  Experiments are conducted on 12 hour CNN/ABC news, and 12 hour documentaries (Discovery and National Geography), high recall and precision of 98% -99% have been achieved.  ...  Search of 1 min. long video from 12 hour video database can be completed in 1 second provided features are pre-calculated. efficient and robust unknown short video repeats discovering.  ... 
doi:10.1109/icassp.2007.366145 dblp:conf/icassp/YangXT07 fatcat:xt5cbs4fu5d2tns2abrsibftki

Analytical Study of Association Rule Mining Methods in Data Mining

Bhavesh M. Patel, Vishal H. Bhemwala, Dr. Ashok R. Patel
2018 International Journal of Scientific Research in Computer Science Engineering and Information Technology  
Here during this analytical paper, we have been tried to incorporate survey of analysis systematically towards association rule mining from last many years to till date from totally different researchers  ...  It's true that one paper isn't enough for complete analysis of all smart researches, however it'll facilitate in future to urge right direction towards association rule mining analysis for fascinating,  ...  In 2001, Zaki M.J. [88] introduced another algorithm "SPADE" for mining frequent sequences. It was an efficient and scalable algorithm for faster discovery of Sequential Patterns.  ... 
doi:10.32628/cseit1833244 fatcat:ndopsdk6enfr7hphvuhmiym43e

Correlation based dynamic time warping of multivariate time series

Zoltán Bankó, János Abonyi
2012 Expert systems with applications  
This paper proposes a new algorithm for the comparison of multivariate time series which generalize DTW for the needs of correlated multivariate time series.  ...  Acknowledgement The authors acknowledge the financial support of the Cooperative Research Centre (  ...  Technically speaking, the Euclidean distance allows the efficient indexing of large time series databases.  ... 
doi:10.1016/j.eswa.2012.05.012 fatcat:kuwxr2owxze7fdkzhtlqw7cc5q

A Comparative Study on Temporal Mobile Access Pattern Mining Methods

Hanan Fahmy, Maha A.Hana, Yahia K.
2012 International Journal of Advanced Computer Science and Applications  
In this paper, temporal mobile access pattern methods are studied and compared in terms of complexity and accuracy. The advantages and disadvantages of these methods will be summarized as well.  ...  Mobile users behavior patterns is one of the most critical issues that need to be explored in mobile agent systems.  ...  Temporal Data Mining is a single step in the process of Knowledge Discovery (KD) in temporal databases that enumerates structures (temporal patterns or models) over the temporal data, and any algorithm  ... 
doi:10.14569/ijacsa.2012.030323 fatcat:orfdb7mc3fbovneuz36why5kaa
« Previous Showing results 1 — 15 out of 9,990 results