{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:18:48Z","timestamp":1736615928836,"version":"3.32.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T00:00:00Z","timestamp":1161043200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2006,11]]},"DOI":"10.1007\/s10619-006-0445-0","type":"journal-article","created":{"date-parts":[[2006,10,19]],"date-time":"2006-10-19T00:38:27Z","timestamp":1161218307000},"page":"225-243","source":"Crossref","is-referenced-by-count":3,"title":["Parallel Bifold: Large-scale parallel pattern mining with constraints"],"prefix":"10.1007","volume":"20","author":[{"given":"Mohammad","family":"El-Hajj","sequence":"first","affiliation":[]},{"given":"Osmar R.","family":"Za\u00efane","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,10,17]]},"reference":[{"key":"445_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami, \u201cMining association rules between sets of items in large databases,\u201d in Proceedings of the 1993 ACM-SIGMOD International Conference on Management of Data, Washington, DC, May 1993, pp. 207\u2013216.","DOI":"10.1145\/170036.170072"},{"key":"445_CR2","unstructured":"R. Agrawal and R. Srikant, \u201cFast algorithms for mining association rules,\u201d in Proceedings of the 1994 International Conference on Very Large Data Bases, Santiago, Chile, September 1994 pp. 487\u2013499"},{"key":"445_CR3","doi-asserted-by":"crossref","unstructured":"M.-L. Antonie and O.R. Za\u00efane, \u201cText document categorization by term association,\u201d in Proceedings of the IEEE 2002 International Conference on Data Mining, Maebashi City, Japan, 2002, pp. 19\u201326.","DOI":"10.1109\/ICDM.2002.1183881"},{"key":"445_CR4","unstructured":"W.H.B. Liu and Y. Ma, \u201cIntegrating classification and association rule mining,\u201d in 4th International Conference on Knowledge Discovery and Data Mining (KDD\u201998), New York City, NY, August 1998, pp. 80\u201386."},{"key":"445_CR5","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo, \u201cEfficiently mining long patterns from databases,\u201d in ACM SIGMOD, 1998.","DOI":"10.1145\/276304.276313"},{"key":"445_CR6","doi-asserted-by":"crossref","unstructured":"C. Bucila, J. Gehrke, D. Kifer, and W. White, \u201cDualminer: A dual-pruning algorithm for itemsets with constraints,\u201d in Eight ACM SIGKDD Internationa Conference on Knowledge Discovery and Data Mining, Edmonton, 2002, pp. 42\u201351.","DOI":"10.1145\/775047.775054"},{"key":"445_CR7","doi-asserted-by":"crossref","unstructured":"D. Cheung, K. Hu, and S. Xia, \u201cAsynchronous parallel algorithm for mining association rules on a shared-memory multi-processors,\u201d in Proceedings of the 10th ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, 1998, pp. 279\u2013288.","DOI":"10.1145\/277651.277694"},{"key":"445_CR8","doi-asserted-by":"crossref","unstructured":"D.W.-L. Cheung, J. Han, V. Ng, A.W.-C. Fu, and Y. Fu, \u201cA fast distributed algorithm for mining association rules,\u201d in PDIS, 1996, pp. 31\u201342.","DOI":"10.1109\/PDIS.1996.568665"},{"key":"445_CR9","unstructured":"S.M. Chung and C. Luo, \u201cParallel mining of maximal frequent itemsets from databases,\u201d in 15th IEEE International Conference on Tools with Artificial Intelligence, 2003."},{"key":"445_CR10","unstructured":"N.L.D. Gamberger and V. Jovanoski, \u201cHigh confidence association rules for medical diagnosis,\u201d in Intelligent Data Analysis in Medicine and Pharmacology, (IDAMAP\u201999), Washington, DC, November 1999."},{"key":"445_CR11","unstructured":"S. Downs and M. Wallace, \u201cMining association rules from a pediatric primary care decision support system,\u201d in Proceedings of the American Medical Informatics Association Annual Symposium, 2000."},{"key":"445_CR12","doi-asserted-by":"crossref","unstructured":"M. El-Hajj and O.R. Za\u00efane, \u201cMining with constraints by pruning and avoiding ineffectual processing,\u201d in The 18th Australian Joint Conference on Artificial Intelligence, Springer Verlag LNCS 3809, Sydney, Australia, 2005, pp. 1001\u20131004.","DOI":"10.1007\/11589990_129"},{"key":"445_CR13","unstructured":"M. El-Hajj, O.R. Za\u00efane, and P. Nalos, \u201cBifold constraint-based mining by simultaneous monotone and anti-monotone checking,\u201d in The Fifth IEEE International Conference on Data Mining (ICDM\u201905), Houston, TX, 2005."},{"key":"445_CR14","unstructured":"R. Feldman and H. Hirsh, \u201cMining associations in text in the presence of background knowledge,\u201d in Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, August 1996, pp. 343\u2013346."},{"key":"445_CR15","doi-asserted-by":"crossref","unstructured":"A. Freitas, \u201cSurvey of parallel data mining,\u201d in Proceedings of the 2nd International Conference on the Practical Applications of Knowledge Discovery and Data Mining, January 1996, pp. 287\u2013300.","DOI":"10.1049\/ic:19961111"},{"key":"445_CR16","doi-asserted-by":"crossref","unstructured":"E.-H. Han, G. Karypis, and V. Kumar, \u201cScalable parallel data mining for association rules,\u201d in In ACM SIGMOD Conference on Management of Data, 1997.","DOI":"10.1145\/253260.253330"},{"key":"445_CR17","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, and Y. Yin, \u201cMining frequent patterns without candidate generation,\u201d in ACM-SIGMOD, Dallas, 2000.","DOI":"10.1145\/342009.335372"},{"key":"445_CR18","unstructured":"IBM_Almaden. Quest synthetic data generation code. http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html."},{"key":"445_CR19","doi-asserted-by":"crossref","unstructured":"M.D.J. Srivastava, R. Cooley, and P.-N. Tan, \u201cWeb usage mining: Discovery and applications of usage patterns form web data,\u201d in SIGKDD Explorations, vol. 1, no. 2, January 2000.","DOI":"10.1145\/846183.846188"},{"key":"445_CR20","doi-asserted-by":"crossref","unstructured":"L. Lakshmanan, R. Ng, J. Han, and A. Pang, \u201cOptimization of constrained frequent set queries with 2-variable constraints,\u201d in Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD\u201999), 1999, pp. 157\u2013168.","DOI":"10.1145\/304181.304196"},{"key":"445_CR21","unstructured":"H.M.M. Klemettinen and H. Toivonen, \u201cRule discovery in telecommunication alarm data,\u201d Journal of Network and Systems Management, vol. 7, no. 4, 1999."},{"key":"445_CR22","doi-asserted-by":"crossref","unstructured":"S. Park, M. Chen, and P.S. Yu, \u201cEfficient parallel data mining for association rules,\u201d in ACM International Conference on Infomration and Knowledge Management, 1995.","DOI":"10.1145\/221270.221320"},{"key":"445_CR23","doi-asserted-by":"crossref","unstructured":"S. Parthasarathy, M. Zaki, M. Ogihara, and W. Li, \u201cParallel data mining for association rules on shared-memory systems,\u201d Knowledge and Information Systems, vol. 3, no. 1, 2001, pp. 1\u201329.","DOI":"10.1007\/PL00011656"},{"key":"445_CR24","doi-asserted-by":"crossref","unstructured":"J. Pie and J. Han, \u201cCan we push more constraints into frequent pattern mining?\u201d in ACM SIGKDD Conference, 2000, pp. 350\u2013354.","DOI":"10.1145\/347090.347166"},{"key":"445_CR25","doi-asserted-by":"crossref","unstructured":"I. Pramudiono and M. Kitsuregawa, \u201cTree structure based parallel frequent pattern mining on pc cluster,\u201d in DEXA, 2003, pp. 537\u2013547.","DOI":"10.1007\/978-3-540-45227-0_53"},{"key":"445_CR26","doi-asserted-by":"crossref","unstructured":"A.R. and S.J., \u201cParallel mining of association rules,\u201d in IEEE Transactions in Knowledge and Data Eng., 1996, pp. 962\u2013969.","DOI":"10.1109\/69.553164"},{"key":"445_CR27","unstructured":"A. Savasere, E. Omiecinski, and S. Navathe, \u201cAn efficient algorithm for mining association rules in large databases,\u201d in Proceedings of the 21st International Conference on Very Large Data Bases, 1995, pp. 432\u2013444."},{"key":"445_CR28","doi-asserted-by":"crossref","unstructured":"R.M. Ting, J. Bailey, and K. Ramamohanarao, \u201cParadualminer: An efficient parallel implementation of the dualminer algorithm,\u201d in Eight Pacific-Asia Conference, PAKDD 2004, Sydney, Australia, pp. 96\u2013105, May 2004.","DOI":"10.1007\/978-3-540-24775-3_12"},{"key":"445_CR29","doi-asserted-by":"crossref","unstructured":"S.A.A.W. Lin and C. Ruiz, \u201cEfficient adaptive-support association rule mining for recommender systems,\u201d Data Mining and Knowledge Discovery, vol. 6, no. 1, pp. 83\u2013105, January 2002.","DOI":"10.1023\/A:1013284820704"},{"key":"445_CR30","unstructured":"B. Wilkinson and M. Allen, \u201cParallel programming techniques and applications using networked workstations and parallel computers,\u201d in Alan Apt, New Jersy, USA, 1999."},{"key":"445_CR31","doi-asserted-by":"crossref","unstructured":"O.R. Za\u00efane and M. El-Hajj, \u201cPattern lattice traversal by selective jumps,\u201d in Proceedings of the 2005 International Conference on Data Mining and Knowledge Discovery (ACM-SIGKDD), August 2005.","DOI":"10.1145\/1081870.1081964"},{"key":"445_CR32","unstructured":"O.R. Za\u00efane, M. El-Hajj, and P. Lu, \u201cFast parallel association rule mining without candidacy generation,\u201d in Proceedings of the IEEE 2001 International Conference on Data Mining, 2001."},{"key":"445_CR33","doi-asserted-by":"crossref","unstructured":"O.R. Za\u00efane, J. Han, and H. Zhu, \u201cMining recurrent items in multimedia with progressive resolution refinment,\u201d in International Conference on Data Engineering (ICDE\u20192000), San Diego, CA, pp. 461\u2013470, February 2000.","DOI":"10.1109\/ICDE.2000.839445"},{"key":"445_CR34","doi-asserted-by":"crossref","unstructured":"M.J. Zaki and C.-T. Ho, \u201cParallel and distributed association mining: A survey, in ieee concurrency,\u201d special issue on parallel mechanisms for data mining. In vol. 7, no. 4, 1999.","DOI":"10.1109\/4434.806975"},{"key":"445_CR35","unstructured":"M.J. Zaki and C.-T. Ho, \u201cLarge-scale parallel data mining,\u201d lecture notes in artificial intelligence, state-of-the-art-survey. In vol. 1759, Springer-Verlag, 2000."}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-006-0445-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10619-006-0445-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-006-0445-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T16:35:48Z","timestamp":1736613348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-006-0445-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,17]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["445"],"URL":"https:\/\/doi.org\/10.1007\/s10619-006-0445-0","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"type":"print","value":"0926-8782"},{"type":"electronic","value":"1573-7578"}],"subject":[],"published":{"date-parts":[[2006,10,17]]}}}