{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:51:38Z","timestamp":1725670298271},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icdm.2005.31","type":"proceedings-article","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T09:52:38Z","timestamp":1136454758000},"page":"713-716","source":"Crossref","is-referenced-by-count":7,"title":["Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases"],"prefix":"10.1109","author":[{"given":"L.","family":"Lhote","sequence":"first","affiliation":[]},{"given":"F.","family":"Rioult","sequence":"additional","affiliation":[]},{"given":"A.","family":"Soulet","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(92)90120-7"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347101"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233311"},{"key":"12","first-page":"134","article-title":"Sampling large databases for association rules","author":"toivonen","year":"1996","journal-title":"International Conference on Very Large Data Bases"},{"key":"3","article-title":"How well go lattice algorithms on currently used machine learning testbeds ?","author":"fu","year":"2003","journal-title":"Proc First Int'l Conf Formal Concept Analysis"},{"key":"2","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"International Conference on Very Large Data Bases (VLDB'94) Santiago de Chile"},{"key":"1","first-page":"307","article-title":"Fast discovery of association rules","author":"agrawal","year":"1996","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703422881"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1080\/09528130210164170"},{"key":"6","first-page":"215","article-title":"Discovering all most specific sentences by randomized algorithms","author":"gunopulos","year":"1997","journal-title":"ICDT"},{"key":"5","first-page":"209","article-title":"Data mining, hypergraph transversals, and machine learning","author":"gunopulos","year":"1997","journal-title":"PODS 1997"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989513"},{"article-title":"Average number of frequent and closed patterns in random databases","year":"2005","author":"lhote","key":"9"},{"key":"8","first-page":"345","article-title":"Average number of frequent and closed patterns in random databases","author":"lhote","year":"2005","journal-title":"Confe?rence d'Apprentissage CAp'05"}],"event":{"name":"Fifth IEEE International Conference on Data Mining (ICDM'05)","location":"Houston, TX, USA"},"container-title":["Fifth IEEE International Conference on Data Mining (ICDM'05)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10470\/33217\/01565764.pdf?arnumber=1565764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T17:15:36Z","timestamp":1489511736000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1565764\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icdm.2005.31","relation":{},"subject":[]}}