An Efficient Tree-based Frequent Temporal Inter-object Pattern Mining Approach in Time Series Databases

... frequent temporal pattern mining in time series, [21, 24, 29] for frequent sequential pattern mining in sequential databases, and [6, 17, 28] for frequent temporal pattern mining in temporal databases ... treebased frequent temporal inter-object pattern mining algorithm to efficiently discover all frequent temporal inter-object patterns hidd...

Ngày tải lên: 13/08/2015, 10:00

... clock BETTINI ET AL.: DISCOVERING FREQUENT EVENT PATTERNS WITH MULTIPLE GRANULARITIES IN TIME SEQUENCES 227 Fig An example of timed automaton with granularities decomposition of S into chains from ... ‹ n and t2 µ are both defined, BETTINI ET AL.: DISCOVERING FREQUENT EVENT PATTERNS WITH MULTIPLE GRANULARITIES IN TIME SEQUENCES Intuitively, for tim...

Ngày tải lên: 16/03/2014, 19:20

... our entity- aspect model and standard LDA model as well as a K-means sentence clustering method In Table 6, we show the top frequent words of three sample aspects as found by our method, standard ... 4: Quality of sentence patterns in terms of precision, recall and f1 Method Our entityaspect model Standard LDA K-means university received ph.d college degree physics american p...

Ngày tải lên: 23/03/2014, 16:20

... work on mining interesting association patterns in spatial, temporal and spatio- temporal databases In Chapter 3, we study the problem of finding topological patterns in spatio- temporal databases ... constraints into two categories according to their application semantics and roles in sequence pattern mining 2.3 Mining Spatio- temporal Databases As a signific...

Ngày tải lên: 11/09/2015, 14:31

... of the problem, optimal algorithms can solve some instances of the p- median problem with reasonable effort A typical approach is to combine Lagrangian relaxation with branch-and-bound (see, for ... members of the population after every population update The steps for the replacement operator are as follows Replacement Operator Input: One candidate member Step If fitness value...

Ngày tải lên: 08/08/2013, 08:38

... used for parsing different sentences Conclusion and Future Work We described PSTFS, a substrate for parallel processing of typed feature structures PSTFS serves as an efficient programming environment ... operations on shared heaps by parallel agents Application and Performance Evaluation This section describes two different types of HPSG parsers implemented on PSTFS O...

Ngày tải lên: 20/02/2014, 18:20

... guess, and provide an informal proof of its efficiency A Greedy Algorithm Incremental Generation We begin by describing the fundamentals of a greedy incremental generation algorithm The cruciM data ... some key assumptions about suitable TNCBs for generation, and then describe the algorithm itself 2.1 (4) The brown dog as well as the 'correct' one Generation will fail if all si...

Ngày tải lên: 20/02/2014, 22:20

... 20 Regulatory Environment for Bond Trading and Related Institutions Bond Markets in Serbia Regulation and Bond Trading in Practice 4.1 Bond Trading: BSE and OTC An important step in developing ... Bond Markets in Serbia Bond Markets in Serbia: regulatory challenges for an efficient market © Jefferson Institute 2005 Published by: Jefferson Instit...

Ngày tải lên: 15/03/2014, 09:20

... steps performed by an HTTP (Web) server HTTP clients use the TCP transport protocol to contact Web servers and request content The client opens a TCP connection to the server, and transmits a HTTP ... configuration Special thanks to Zeus Technology for use of their server software and Damian Reeves for feedback and technical assistance with it Thanks to Jef Poskanzer for the t...

Ngày tải lên: 16/03/2014, 19:20

... system Therefore, it is expected to play an important role in synthesizing linguistic analyses such as parsing and semantic analysis, and linguistic and non-linguistic inferences versity Press ... we can solve a constraint satisfaction problem by constraint transformation What we seek is an efficient algorithm of transformation whose resulting structure is guaranteed satisfiability and...

Ngày tải lên: 17/03/2014, 08:20

... keeps the index small but introduces another problem: A query treegram may not appear in the treegram index as it is Therefore, VENONA expands all query treegram structures at runtime; for a given ... subtree variables, the index has to contain all matching treegrams for that subtree (c) It is quite expensive to intersect the tree sets T(DB, g) for all treegrams g containe...

Ngày tải lên: 17/03/2014, 23:20

... Conclusions We have described a new efficient statistical speech act type tagging system based on a statistical model used in Japanese morphological analyzers This system integrates linguistic, acoustic, ... features and efficiently performs optimal segmentation of a turn and tagging From several tagging experiments, we showed that the system segmented turns and assign...

Ngày tải lên: 31/03/2014, 04:20

... idea of using chart parsers as deductive-proof procedures can easily be extended to the idea of using chart parsers as abductive-proof procedures Because chart parsers have many advantages from ... spoken language understanding Figure provides the rules for spoken Japanese understanding, with which the sentence (1) is parsed and interpreted T h e y include the pragmatic, semantic and...

Ngày tải lên: 31/03/2014, 06:20

... following forms: • NA stands for null adjoining and means that at node X no adjoining can take place, • SA(B) stands for selective adjoining and means that at X the adjoining of an auxil- 285 iary tree ... place (where each tree in B h a s the same root and foot node label as X) or TWO FORM TRANSFORMATION The parsing algorithm of Vijay.Shanker and Joshi • OA(B) stands for...

Ngày tải lên: 31/03/2014, 18:20

... Amsterdam-Atlanta Bod, R 1992 Data Oriented Parsing, Proceedings COLING'92, Nantes, France Bod, R 1993 Using an Annotated Language Corpus as a Virtual Stochastic Grammar, Proceedings AAAI'93, Washington ... Characterization and New Examples Proceedings of 7th conference on Formal Grammar Charniak, E 1996 Tree-bank Grammars, Proceedings AAAT96, Menlo Park, Ca Charniak, E 1997 Statistical...

Ngày tải lên: 31/03/2014, 20:20