{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:18:49Z","timestamp":1760707129823},"reference-count":14,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0950-7051(03)00025-x","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T18:45:52Z","timestamp":1053369952000},"page":"243-251","source":"Crossref","is-referenced-by-count":32,"title":["A rough set model with ontologies for discovering maximal association rules in document collections"],"prefix":"10.1016","volume":"16","author":[{"given":"Yaxin","family":"Bi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terry","family":"Anderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sally","family":"McClean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0950-7051(03)00025-X_BIB1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","article-title":"Mining association rules between sets of items in large databases","author":"Agrawal","year":"1993","journal-title":"Proceedings of the ACM SIGMOD Conference (Washington DC)"},{"key":"10.1016\/S0950-7051(03)00025-X_BIB2","first-page":"167","article-title":"Maximal association rules: a new tool for mining for keywords co-occurrences in document collections","author":"Feldman","year":"1997","journal-title":"Proceedings of the Third International Conference on Konwledge Discovery (KDD 1997)"},{"key":"10.1016\/S0950-7051(03)00025-X_BIB3","first-page":"407","article-title":"Mining generalized association rules","author":"Srikant","year":"1995","journal-title":"Proceedings of the 21st International Conference on Very Large Databases (Zurich, Switzerland)"},{"issue":"2","key":"10.1016\/S0950-7051(03)00025-X_BIB4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/PL00011664","article-title":"Multipass algorithms for mining association rules","volume":"3","author":"Holt","year":"2001","journal-title":"Text Databases, Knowledge and Information Systems"},{"key":"10.1016\/S0950-7051(03)00025-X_BIB5","unstructured":"Reuters-21578, http:\/\/www.research.att.com\/lewis\/reuters21578.html, 2002."},{"key":"10.1016\/S0950-7051(03)00025-X_BIB6","series-title":"Lecture Notes in Artificial Intelligence 1510: Principles of Data Mining and Knowledge Discovery","author":"Feldman","year":"1998"},{"issue":"2","key":"10.1016\/S0950-7051(03)00025-X_BIB7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1006\/knac.1993.1008","article-title":"A translation approach to portable ontology specifications","volume":"5","author":"Gruber","year":"1993","journal-title":"Knowledge Acquisition"},{"key":"10.1016\/S0950-7051(03)00025-X_BIB8","unstructured":"WordNet, www.cogsci.princeton.edu\/~wn, 2002."},{"key":"10.1016\/S0950-7051(03)00025-X_BIB9","unstructured":"UN Classifications Registry, esa.un.org\/unsd\/cr\/registry, 2002."},{"key":"10.1016\/S0950-7051(03)00025-X_BIB10","unstructured":"RAMON, europa.eu.int\/comm\/eurostat\/ramon, 2002."},{"key":"10.1016\/S0950-7051(03)00025-X_BIB11","series-title":"The Semantic Web: Why, What, and How","article-title":"Ontologies come of age","author":"McGuinness","year":"2002"},{"key":"10.1016\/S0950-7051(03)00025-X_BIB12","series-title":"Rough Set: Theoretical Aspects of Reasoning About Data","author":"Pawlak","year":"1991"},{"key":"10.1016\/S0950-7051(03)00025-X_BIB13","first-page":"101","article-title":"Rule generation based on rough set theory for text classification","author":"Bi","year":"2000","journal-title":"Twentieth SGES International Conference on KBS and Applied AI (Cambridge, UK"},{"key":"10.1016\/S0950-7051(03)00025-X_BIB14","first-page":"11","article-title":"Finding all frequent maximal sequences in text","author":"Ahonen-Myka","year":"1999"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095070510300025X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095070510300025X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T09:57:53Z","timestamp":1553162273000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S095070510300025X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":14,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S095070510300025X"],"URL":"https:\/\/doi.org\/10.1016\/s0950-7051(03)00025-x","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}