iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1007/11596448_108
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:57:58Z","timestamp":1725551878693},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540308188"},{"type":"electronic","value":"9783540315995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11596448_108","type":"book-chapter","created":{"date-parts":[[2006,6,17]],"date-time":"2006-06-17T13:12:37Z","timestamp":1150549957000},"page":"735-740","source":"Crossref","is-referenced-by-count":3,"title":["An FP-Tree Based Approach for Mining All Strongly Correlated Item Pairs"],"prefix":"10.1007","author":[{"given":"Zengyou","family":"He","sequence":"first","affiliation":[]},{"given":"Shengchun","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Xiaofei","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"108_CR1","doi-asserted-by":"crossref","unstructured":"Xiong, H., Shekhar, S., Tan, P.-N., Kumar, V.: Exploiting a Support-based Upper Bound of Pearson\u2019s Correlation Coefficient for Efficiently Identifying Strongly Correlated Pairs. In: Proceedings of SIGKDD 2004, pp. 334\u2013343 (2004)","DOI":"10.1145\/1014052.1014090"},{"key":"108_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of VLDB 1994, pp. 478\u2013499 (1994)"},{"issue":"3","key":"108_CR3","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering\u00a012(3), 372\u2013390 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"108_CR4","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, J.: Mining Frequent Patterns without Candidate Generation. In: Proceedings of SIGMOD 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"108_CR5","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond Market Basket: Generalizing Association Rules to Correlations. In: Proceedings of SIGMOD 1997, pp. 265\u2013276 (1997)","DOI":"10.1145\/253260.253327"},{"key":"108_CR6","unstructured":"Ma, S., Hellerstein, J.L.: Mining Mutually Dependent Patterns. In: Proceedings of ICDM 2001, pp. 409\u2013416 (2001)"},{"issue":"1","key":"108_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TKDE.2003.1161582","volume":"15","author":"E. Omiecinski","year":"2003","unstructured":"Omiecinski, E.: Alternative Interest Measures for Mining Associations. IEEE Transactions on Knowledge and Data Engineering\u00a015(1), 57\u201369 (2003)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"108_CR8","doi-asserted-by":"crossref","unstructured":"Lee, Y.K., Kim, W.Y., Cai, Y.D., Han, J.: CoMine: Efficient Mining of Correlated Patterns. In: Proceedings of ICDM 2003, pp. 581\u2013584 (2003)","DOI":"10.1109\/ICDM.2003.1250982"},{"key":"108_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-540-24775-3_68","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"W.Y. Kim","year":"2004","unstructured":"Kim, W.Y., Lee, Y.K., Han, J.: CCMine: Efficient Mining of Confidence-Closed Correlated Patterns. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 569\u2013579. Springer, Heidelberg (2004)"},{"key":"108_CR10","unstructured":"Merz, C.J., Merphy, P.: UCI Repository of Machine Learning Databases (1996), \n \n http:\/\/www.ics.uci.edu\/~mlearn\/MLRRepository.html"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11596448_108.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:55:24Z","timestamp":1619506524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11596448_108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540308188","9783540315995"],"references-count":10,"URL":"http:\/\/dx.doi.org\/10.1007\/11596448_108","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}