{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:55:18Z","timestamp":1725494118892},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664581"},{"type":"electronic","value":"9783540482987"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48298-9_35","type":"book-chapter","created":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T04:16:27Z","timestamp":1193717787000},"page":"331-342","source":"Crossref","is-referenced-by-count":0,"title":["A New Modeling Technique Based on Markov Chains to Mine Behavioral Patterns in Event Based Time Series"],"prefix":"10.1007","author":[{"given":"S.","family":"Massa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Paolucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. P.","family":"Puliafito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,1]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S. Geman","year":"1984","unstructured":"Geman S., Geman D. (1984) \u201cStochastic relaxation, Gibbs distributions and the Bayesian restoration of images\u201d, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.6, pp. 721\u2013741","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"398","DOI":"10.2307\/2289776","volume":"85","author":"A.E. Gelfand","year":"1990","unstructured":"Gelfand A.E., Smith A.F.M. (1990) \u201cSampling based approaches to calculating marginal densities\u201d, Journal of the American Statistical Association, vol.85 pp.398\u2013409","journal-title":"Journal of the American Statistical Association"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller E. (1953) \u201cEquation of state calculations by fast computing machines\u201d, Journal of Chemical Physics, vol.21 pp.1087\u20131092","journal-title":"Journal of Chemical Physics"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"W.K. Hastings","year":"1970","unstructured":"Hastings W.K. (1970) \u201cMonte Carlo sampling method using Markov chains and their applications\u201d, Biometrika, vol.57 pp. 97\u2013109","journal-title":"Biometrika"},{"key":"35_CR5","unstructured":"Agrawal R., Srikant R. (1994) \u201cFast algorithms for mining association rules in large databases\u201d in Proc. of VLDB Conference, Santiago, Chile."},{"key":"35_CR6","unstructured":"Mannila H., Toivonen H., Verkamo I. (1994) \u201cEfficient Algorithms for discovering association rules\u201d. In KDD-94: AAAI Workshop on Knowledge Discovery in Databases."},{"key":"35_CR7","unstructured":"Agrawal R., Srikant R. (1995) \u201cMining Sequential Patterns\u201d. IBM Research Report."},{"key":"35_CR8","unstructured":"Howard R.A. (1960) \u201cDynamic programming and Markov processes\u201d. John Wiley."},{"key":"35_CR9","unstructured":"Neal, R. (1993) Probabilistic Inference using Markov Chain Monte Carlo Methods. Dept. of Computer Science, University of Toronto."},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1214\/aoap\/1177005980","volume":"1","author":"P. Diaconis","year":"1991","unstructured":"Diaconis, P., Stroock, D. (1991) Geometric Bounds for eigenvalues of Markov Chains. Annals of Applied Probability, 1, 36\u201361.","journal-title":"Annals of Applied Probability"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/S0169-7161(05)80142-7","volume":"9","author":"S. F. Arnold","year":"1993","unstructured":"Arnold S. F. (1993) Gibbs Sampling. In Handbook of Statistics, 9, 599\u2013626.","journal-title":"Handbook of Statistics"},{"issue":"#4","key":"35_CR12","first-page":"329","volume":"49","author":"S. Chib","year":"1995","unstructured":"Chib S., Greenberg E. (1995) Understanding the Metropolis-Hastings Algorithm. The American Statistician. 49, #4, 329\u2013335.","journal-title":"The American Statistician"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, A. Swami (1993) Mining Association Rules between Sets of Items in Large Databases, Proceeding of the 1993 ACM SIGMOD Conference.","DOI":"10.1145\/170035.170072"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, I. Verkamo (1994) Finding Interesting Rules from Large Sets of Discovered Association Rules, Third International Conference on Information and Knowledge Management, Gaithersburg, Maryland.","DOI":"10.1145\/191246.191314"}],"container-title":["Lecture Notes in Computer Science","DataWarehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48298-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T20:25:15Z","timestamp":1551039915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48298-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664581","9783540482987"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48298-9_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}