Online mining of recent music query streams

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Li, Hua-Fu	en_US
dc.contributor.author	Ho, Chin-Chuan	en_US
dc.contributor.author	Shan, Man-Kwan	en_US
dc.contributor.author	Lee, Suh-Yin	en_US
dc.date.accessioned	2014-12-08T15:25:06Z	-
dc.date.available	2014-12-08T15:25:06Z	-
dc.date.issued	2006	en_US
dc.identifier.isbn	978-1-4244-0366-0	en_US
dc.identifier.uri	http://hdl.handle.net/11536/17475	-
dc.identifier.uri	http://dx.doi.org/10.1109/ICME.2006.262948	en_US
dc.description.abstract	Mining multimedia data is one of the most important issues in data mining. In this paper, we propose an online one-pass algorithm to mine the set of frequent temporal patterns in online music query streams with a sliding window. An effective bit-sequence representation is used to reduce the processing time and memory needed to slide the windows. Experiments show that the proposed algorithm only needs a half of memory requirement of original music query data, and just scans the data once.	en_US
dc.language.iso	en_US	en_US
dc.title	Online mining of recent music query streams	en_US
dc.type	Proceedings Paper	en_US
dc.identifier.doi	10.1109/ICME.2006.262948	en_US
dc.identifier.journal	2006 IEEE International Conference on Multimedia and Expo - ICME 2006, Vols 1-5, Proceedings	en_US
dc.citation.spage	1985	en_US
dc.citation.epage	1988	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000245384804058	-
顯示於類別：	會議論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。