https://scholars.lib.ntu.edu.tw/handle/123456789/415124
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Lee A.J.T. | en_US |
dc.contributor.author | Liu Y.-H. | en_US |
dc.contributor.author | Tsai H.-M. | en_US |
dc.contributor.author | Lin H.-H. | en_US |
dc.contributor.author | HSIN-MU TSAI | en_US |
dc.creator | Wu H.-W.;Lin H.-H.;Tsai H.-M.;Liu Y.-H.;Lee A.J.T. | - |
dc.date.accessioned | 2019-07-24T08:33:05Z | - |
dc.date.available | 2019-07-24T08:33:05Z | - |
dc.date.issued | 2009 | - |
dc.identifier.issn | 01641212 | - |
dc.identifier.uri | https://scholars.lib.ntu.edu.tw/handle/123456789/415124 | - |
dc.description.abstract | In this paper, we propose a novel algorithm, called 9DSPA-Miner, to mine frequent patterns from an image database, where every image is represented by the 9D-SPA representation. Our proposed method consists of three phases. First, we scan the database once and create an index structure. Next, the index structure is scanned to find all frequent patterns of length two. Finally, we use the frequent k-patterns (k ? 2) to generate candidate (k + 1)-patterns and check if the support of each candidate generated is not less than the user-specified minimum support threshold by using the index structure. Then, the steps in the third phase are repeated until no more frequent patterns can be found. Since the 9DSPA-Miner algorithm uses the characteristics of the 9D-SPA representation to prune most of impossible candidates, the experiment results demonstrate that it is more efficient and scalable than the modified Apriori method. ? 2008 Elsevier Inc. All rights reserved. | - |
dc.language | English | - |
dc.relation.ispartof | Journal of Systems and Software | - |
dc.subject | 9D-SPA representation | - |
dc.subject | Data mining | - |
dc.subject | Spatial association rules | - |
dc.subject | Spatial frequent patterns | - |
dc.title | Mining frequent patterns in image databases with 9D-SPA representation | en_US |
dc.type | journal article | en |
dc.identifier.doi | 10.1016/j.jss.2008.08.028 | - |
dc.identifier.scopus | 2-s2.0-62849118066 | - |
dc.identifier.url | https://www.scopus.com/inward/record.uri?eid=2-s2.0-62849118066&doi=10.1016%2fj.jss.2008.08.028&partnerID=40&md5=434c18f2cc9e608c1af41070c5aeb9d9 | - |
dc.relation.pages | 603-618 | - |
dc.relation.journalvolume | 82 | - |
dc.relation.journalissue | 4 | - |
item.cerifentitytype | Publications | - |
item.fulltext | no fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.openairetype | journal article | - |
item.grantfulltext | none | - |
crisitem.author.dept | Information Management | - |
crisitem.author.dept | Networking and Multimedia | - |
crisitem.author.dept | Computer Science and Information Engineering | - |
crisitem.author.dept | Intel-NTU Connected Context Computing Center | - |
crisitem.author.orcid | 0000-0003-0320-7309 | - |
crisitem.author.orcid | 0000-0003-1106-0722 | - |
crisitem.author.parentorg | College of Management | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | Others: University-Level Research Centers | - |
crisitem.author.parentorg | Others: International Research Centers | - |
顯示於: | 資訊管理學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。