Editing Compression Dictionaries toward Refined Compression-Based Feature-Space
This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). S...
Ausführliche Beschreibung
Autor*in: |
Hisashi Koga [verfasserIn] Shota Ouchi [verfasserIn] Yuji Nakajima [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2022 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
In: Information - MDPI AG, 2010, 13(2022), 6, p 301 |
---|---|
Übergeordnetes Werk: |
volume:13 ; year:2022 ; number:6, p 301 |
Links: |
---|
DOI / URN: |
10.3390/info13060301 |
---|
Katalog-ID: |
DOAJ027322939 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | DOAJ027322939 | ||
003 | DE-627 | ||
005 | 20240414202650.0 | ||
007 | cr uuu---uuuuu | ||
008 | 230226s2022 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.3390/info13060301 |2 doi | |
035 | |a (DE-627)DOAJ027322939 | ||
035 | |a (DE-599)DOAJa267bf29b93641b7afc5415e2f0aca28 | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
050 | 0 | |a T58.5-58.64 | |
100 | 0 | |a Hisashi Koga |e verfasserin |4 aut | |
245 | 1 | 0 | |a Editing Compression Dictionaries toward Refined Compression-Based Feature-Space |
264 | 1 | |c 2022 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). Specifically, we focus on the known framework called PRDC, which represents an object <i<x</i< as a compression-ratio vector (CV) that lines up the compression ratios after <i<x</i< is compressed with multiple different dictionaries. By representing an object <i<x</i< as a CV, PRDC makes it possible to apply vector-based pattern recognition techniques to the compression-based pattern recognition. For PRDC, the dimensions, i.e., the dictionaries determine the quality of the CV space. This paper presents a practical technique to modify the chosen dictionaries in order to improve the performance of pattern recognition substantially: First, in order to make the dictionaries independent from each other, our method leaves any word shared by multiple dictionaries in only one dictionary and assures that any pair of dictionaries have no common words. Next, we transfer words among the dictionaries, so that all the dictionaries may keep roughly the same number of words and acquire the descriptive power evenly. The application to real image classification shows that our method increases classification accuracy by up to 8% compared with the case without our method, which demonstrates that our approach to keep the dictionaries independent is effective. | ||
650 | 4 | |a compression-based pattern recognition | |
650 | 4 | |a data compression | |
650 | 4 | |a feature space | |
650 | 4 | |a compression dictionary | |
653 | 0 | |a Information technology | |
700 | 0 | |a Shota Ouchi |e verfasserin |4 aut | |
700 | 0 | |a Yuji Nakajima |e verfasserin |4 aut | |
773 | 0 | 8 | |i In |t Information |d MDPI AG, 2010 |g 13(2022), 6, p 301 |w (DE-627)654746753 |w (DE-600)2599790-7 |x 20782489 |7 nnns |
773 | 1 | 8 | |g volume:13 |g year:2022 |g number:6, p 301 |
856 | 4 | 0 | |u https://doi.org/10.3390/info13060301 |z kostenfrei |
856 | 4 | 0 | |u https://doaj.org/article/a267bf29b93641b7afc5415e2f0aca28 |z kostenfrei |
856 | 4 | 0 | |u https://www.mdpi.com/2078-2489/13/6/301 |z kostenfrei |
856 | 4 | 2 | |u https://doaj.org/toc/2078-2489 |y Journal toc |z kostenfrei |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_DOAJ | ||
912 | |a GBV_ILN_11 | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_39 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_63 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_161 | ||
912 | |a GBV_ILN_170 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_285 | ||
912 | |a GBV_ILN_293 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2055 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_4012 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4335 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4367 | ||
912 | |a GBV_ILN_4700 | ||
951 | |a AR | ||
952 | |d 13 |j 2022 |e 6, p 301 |
author_variant |
h k hk s o so y n yn |
---|---|
matchkey_str |
article:20782489:2022----::dtncmrsinitoaisoadeiecmrs |
hierarchy_sort_str |
2022 |
callnumber-subject-code |
T |
publishDate |
2022 |
allfields |
10.3390/info13060301 doi (DE-627)DOAJ027322939 (DE-599)DOAJa267bf29b93641b7afc5415e2f0aca28 DE-627 ger DE-627 rakwb eng T58.5-58.64 Hisashi Koga verfasserin aut Editing Compression Dictionaries toward Refined Compression-Based Feature-Space 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). Specifically, we focus on the known framework called PRDC, which represents an object <i<x</i< as a compression-ratio vector (CV) that lines up the compression ratios after <i<x</i< is compressed with multiple different dictionaries. By representing an object <i<x</i< as a CV, PRDC makes it possible to apply vector-based pattern recognition techniques to the compression-based pattern recognition. For PRDC, the dimensions, i.e., the dictionaries determine the quality of the CV space. This paper presents a practical technique to modify the chosen dictionaries in order to improve the performance of pattern recognition substantially: First, in order to make the dictionaries independent from each other, our method leaves any word shared by multiple dictionaries in only one dictionary and assures that any pair of dictionaries have no common words. Next, we transfer words among the dictionaries, so that all the dictionaries may keep roughly the same number of words and acquire the descriptive power evenly. The application to real image classification shows that our method increases classification accuracy by up to 8% compared with the case without our method, which demonstrates that our approach to keep the dictionaries independent is effective. compression-based pattern recognition data compression feature space compression dictionary Information technology Shota Ouchi verfasserin aut Yuji Nakajima verfasserin aut In Information MDPI AG, 2010 13(2022), 6, p 301 (DE-627)654746753 (DE-600)2599790-7 20782489 nnns volume:13 year:2022 number:6, p 301 https://doi.org/10.3390/info13060301 kostenfrei https://doaj.org/article/a267bf29b93641b7afc5415e2f0aca28 kostenfrei https://www.mdpi.com/2078-2489/13/6/301 kostenfrei https://doaj.org/toc/2078-2489 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 13 2022 6, p 301 |
spelling |
10.3390/info13060301 doi (DE-627)DOAJ027322939 (DE-599)DOAJa267bf29b93641b7afc5415e2f0aca28 DE-627 ger DE-627 rakwb eng T58.5-58.64 Hisashi Koga verfasserin aut Editing Compression Dictionaries toward Refined Compression-Based Feature-Space 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). Specifically, we focus on the known framework called PRDC, which represents an object <i<x</i< as a compression-ratio vector (CV) that lines up the compression ratios after <i<x</i< is compressed with multiple different dictionaries. By representing an object <i<x</i< as a CV, PRDC makes it possible to apply vector-based pattern recognition techniques to the compression-based pattern recognition. For PRDC, the dimensions, i.e., the dictionaries determine the quality of the CV space. This paper presents a practical technique to modify the chosen dictionaries in order to improve the performance of pattern recognition substantially: First, in order to make the dictionaries independent from each other, our method leaves any word shared by multiple dictionaries in only one dictionary and assures that any pair of dictionaries have no common words. Next, we transfer words among the dictionaries, so that all the dictionaries may keep roughly the same number of words and acquire the descriptive power evenly. The application to real image classification shows that our method increases classification accuracy by up to 8% compared with the case without our method, which demonstrates that our approach to keep the dictionaries independent is effective. compression-based pattern recognition data compression feature space compression dictionary Information technology Shota Ouchi verfasserin aut Yuji Nakajima verfasserin aut In Information MDPI AG, 2010 13(2022), 6, p 301 (DE-627)654746753 (DE-600)2599790-7 20782489 nnns volume:13 year:2022 number:6, p 301 https://doi.org/10.3390/info13060301 kostenfrei https://doaj.org/article/a267bf29b93641b7afc5415e2f0aca28 kostenfrei https://www.mdpi.com/2078-2489/13/6/301 kostenfrei https://doaj.org/toc/2078-2489 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 13 2022 6, p 301 |
allfields_unstemmed |
10.3390/info13060301 doi (DE-627)DOAJ027322939 (DE-599)DOAJa267bf29b93641b7afc5415e2f0aca28 DE-627 ger DE-627 rakwb eng T58.5-58.64 Hisashi Koga verfasserin aut Editing Compression Dictionaries toward Refined Compression-Based Feature-Space 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). Specifically, we focus on the known framework called PRDC, which represents an object <i<x</i< as a compression-ratio vector (CV) that lines up the compression ratios after <i<x</i< is compressed with multiple different dictionaries. By representing an object <i<x</i< as a CV, PRDC makes it possible to apply vector-based pattern recognition techniques to the compression-based pattern recognition. For PRDC, the dimensions, i.e., the dictionaries determine the quality of the CV space. This paper presents a practical technique to modify the chosen dictionaries in order to improve the performance of pattern recognition substantially: First, in order to make the dictionaries independent from each other, our method leaves any word shared by multiple dictionaries in only one dictionary and assures that any pair of dictionaries have no common words. Next, we transfer words among the dictionaries, so that all the dictionaries may keep roughly the same number of words and acquire the descriptive power evenly. The application to real image classification shows that our method increases classification accuracy by up to 8% compared with the case without our method, which demonstrates that our approach to keep the dictionaries independent is effective. compression-based pattern recognition data compression feature space compression dictionary Information technology Shota Ouchi verfasserin aut Yuji Nakajima verfasserin aut In Information MDPI AG, 2010 13(2022), 6, p 301 (DE-627)654746753 (DE-600)2599790-7 20782489 nnns volume:13 year:2022 number:6, p 301 https://doi.org/10.3390/info13060301 kostenfrei https://doaj.org/article/a267bf29b93641b7afc5415e2f0aca28 kostenfrei https://www.mdpi.com/2078-2489/13/6/301 kostenfrei https://doaj.org/toc/2078-2489 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 13 2022 6, p 301 |
allfieldsGer |
10.3390/info13060301 doi (DE-627)DOAJ027322939 (DE-599)DOAJa267bf29b93641b7afc5415e2f0aca28 DE-627 ger DE-627 rakwb eng T58.5-58.64 Hisashi Koga verfasserin aut Editing Compression Dictionaries toward Refined Compression-Based Feature-Space 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). Specifically, we focus on the known framework called PRDC, which represents an object <i<x</i< as a compression-ratio vector (CV) that lines up the compression ratios after <i<x</i< is compressed with multiple different dictionaries. By representing an object <i<x</i< as a CV, PRDC makes it possible to apply vector-based pattern recognition techniques to the compression-based pattern recognition. For PRDC, the dimensions, i.e., the dictionaries determine the quality of the CV space. This paper presents a practical technique to modify the chosen dictionaries in order to improve the performance of pattern recognition substantially: First, in order to make the dictionaries independent from each other, our method leaves any word shared by multiple dictionaries in only one dictionary and assures that any pair of dictionaries have no common words. Next, we transfer words among the dictionaries, so that all the dictionaries may keep roughly the same number of words and acquire the descriptive power evenly. The application to real image classification shows that our method increases classification accuracy by up to 8% compared with the case without our method, which demonstrates that our approach to keep the dictionaries independent is effective. compression-based pattern recognition data compression feature space compression dictionary Information technology Shota Ouchi verfasserin aut Yuji Nakajima verfasserin aut In Information MDPI AG, 2010 13(2022), 6, p 301 (DE-627)654746753 (DE-600)2599790-7 20782489 nnns volume:13 year:2022 number:6, p 301 https://doi.org/10.3390/info13060301 kostenfrei https://doaj.org/article/a267bf29b93641b7afc5415e2f0aca28 kostenfrei https://www.mdpi.com/2078-2489/13/6/301 kostenfrei https://doaj.org/toc/2078-2489 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 13 2022 6, p 301 |
allfieldsSound |
10.3390/info13060301 doi (DE-627)DOAJ027322939 (DE-599)DOAJa267bf29b93641b7afc5415e2f0aca28 DE-627 ger DE-627 rakwb eng T58.5-58.64 Hisashi Koga verfasserin aut Editing Compression Dictionaries toward Refined Compression-Based Feature-Space 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). Specifically, we focus on the known framework called PRDC, which represents an object <i<x</i< as a compression-ratio vector (CV) that lines up the compression ratios after <i<x</i< is compressed with multiple different dictionaries. By representing an object <i<x</i< as a CV, PRDC makes it possible to apply vector-based pattern recognition techniques to the compression-based pattern recognition. For PRDC, the dimensions, i.e., the dictionaries determine the quality of the CV space. This paper presents a practical technique to modify the chosen dictionaries in order to improve the performance of pattern recognition substantially: First, in order to make the dictionaries independent from each other, our method leaves any word shared by multiple dictionaries in only one dictionary and assures that any pair of dictionaries have no common words. Next, we transfer words among the dictionaries, so that all the dictionaries may keep roughly the same number of words and acquire the descriptive power evenly. The application to real image classification shows that our method increases classification accuracy by up to 8% compared with the case without our method, which demonstrates that our approach to keep the dictionaries independent is effective. compression-based pattern recognition data compression feature space compression dictionary Information technology Shota Ouchi verfasserin aut Yuji Nakajima verfasserin aut In Information MDPI AG, 2010 13(2022), 6, p 301 (DE-627)654746753 (DE-600)2599790-7 20782489 nnns volume:13 year:2022 number:6, p 301 https://doi.org/10.3390/info13060301 kostenfrei https://doaj.org/article/a267bf29b93641b7afc5415e2f0aca28 kostenfrei https://www.mdpi.com/2078-2489/13/6/301 kostenfrei https://doaj.org/toc/2078-2489 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 13 2022 6, p 301 |
language |
English |
source |
In Information 13(2022), 6, p 301 volume:13 year:2022 number:6, p 301 |
sourceStr |
In Information 13(2022), 6, p 301 volume:13 year:2022 number:6, p 301 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
compression-based pattern recognition data compression feature space compression dictionary Information technology |
isfreeaccess_bool |
true |
container_title |
Information |
authorswithroles_txt_mv |
Hisashi Koga @@aut@@ Shota Ouchi @@aut@@ Yuji Nakajima @@aut@@ |
publishDateDaySort_date |
2022-01-01T00:00:00Z |
hierarchy_top_id |
654746753 |
id |
DOAJ027322939 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ027322939</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240414202650.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/info13060301</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ027322939</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJa267bf29b93641b7afc5415e2f0aca28</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T58.5-58.64</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Hisashi Koga</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Editing Compression Dictionaries toward Refined Compression-Based Feature-Space</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). Specifically, we focus on the known framework called PRDC, which represents an object <i<x</i< as a compression-ratio vector (CV) that lines up the compression ratios after <i<x</i< is compressed with multiple different dictionaries. By representing an object <i<x</i< as a CV, PRDC makes it possible to apply vector-based pattern recognition techniques to the compression-based pattern recognition. For PRDC, the dimensions, i.e., the dictionaries determine the quality of the CV space. This paper presents a practical technique to modify the chosen dictionaries in order to improve the performance of pattern recognition substantially: First, in order to make the dictionaries independent from each other, our method leaves any word shared by multiple dictionaries in only one dictionary and assures that any pair of dictionaries have no common words. Next, we transfer words among the dictionaries, so that all the dictionaries may keep roughly the same number of words and acquire the descriptive power evenly. The application to real image classification shows that our method increases classification accuracy by up to 8% compared with the case without our method, which demonstrates that our approach to keep the dictionaries independent is effective.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">compression-based pattern recognition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">data compression</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">feature space</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">compression dictionary</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information technology</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Shota Ouchi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yuji Nakajima</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Information</subfield><subfield code="d">MDPI AG, 2010</subfield><subfield code="g">13(2022), 6, p 301</subfield><subfield code="w">(DE-627)654746753</subfield><subfield code="w">(DE-600)2599790-7</subfield><subfield code="x">20782489</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:13</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:6, p 301</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/info13060301</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/a267bf29b93641b7afc5415e2f0aca28</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/2078-2489/13/6/301</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2078-2489</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">13</subfield><subfield code="j">2022</subfield><subfield code="e">6, p 301</subfield></datafield></record></collection>
|
callnumber-first |
T - Technology |
author |
Hisashi Koga |
spellingShingle |
Hisashi Koga misc T58.5-58.64 misc compression-based pattern recognition misc data compression misc feature space misc compression dictionary misc Information technology Editing Compression Dictionaries toward Refined Compression-Based Feature-Space |
authorStr |
Hisashi Koga |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)654746753 |
format |
electronic Article |
delete_txt_mv |
keep |
author_role |
aut aut aut |
collection |
DOAJ |
remote_str |
true |
callnumber-label |
T58 |
illustrated |
Not Illustrated |
issn |
20782489 |
topic_title |
T58.5-58.64 Editing Compression Dictionaries toward Refined Compression-Based Feature-Space compression-based pattern recognition data compression feature space compression dictionary |
topic |
misc T58.5-58.64 misc compression-based pattern recognition misc data compression misc feature space misc compression dictionary misc Information technology |
topic_unstemmed |
misc T58.5-58.64 misc compression-based pattern recognition misc data compression misc feature space misc compression dictionary misc Information technology |
topic_browse |
misc T58.5-58.64 misc compression-based pattern recognition misc data compression misc feature space misc compression dictionary misc Information technology |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Information |
hierarchy_parent_id |
654746753 |
hierarchy_top_title |
Information |
isfreeaccess_txt |
true |
familylinks_str_mv |
(DE-627)654746753 (DE-600)2599790-7 |
title |
Editing Compression Dictionaries toward Refined Compression-Based Feature-Space |
ctrlnum |
(DE-627)DOAJ027322939 (DE-599)DOAJa267bf29b93641b7afc5415e2f0aca28 |
title_full |
Editing Compression Dictionaries toward Refined Compression-Based Feature-Space |
author_sort |
Hisashi Koga |
journal |
Information |
journalStr |
Information |
callnumber-first-code |
T |
lang_code |
eng |
isOA_bool |
true |
recordtype |
marc |
publishDateSort |
2022 |
contenttype_str_mv |
txt |
author_browse |
Hisashi Koga Shota Ouchi Yuji Nakajima |
container_volume |
13 |
class |
T58.5-58.64 |
format_se |
Elektronische Aufsätze |
author-letter |
Hisashi Koga |
doi_str_mv |
10.3390/info13060301 |
author2-role |
verfasserin |
title_sort |
editing compression dictionaries toward refined compression-based feature-space |
callnumber |
T58.5-58.64 |
title_auth |
Editing Compression Dictionaries toward Refined Compression-Based Feature-Space |
abstract |
This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). Specifically, we focus on the known framework called PRDC, which represents an object <i<x</i< as a compression-ratio vector (CV) that lines up the compression ratios after <i<x</i< is compressed with multiple different dictionaries. By representing an object <i<x</i< as a CV, PRDC makes it possible to apply vector-based pattern recognition techniques to the compression-based pattern recognition. For PRDC, the dimensions, i.e., the dictionaries determine the quality of the CV space. This paper presents a practical technique to modify the chosen dictionaries in order to improve the performance of pattern recognition substantially: First, in order to make the dictionaries independent from each other, our method leaves any word shared by multiple dictionaries in only one dictionary and assures that any pair of dictionaries have no common words. Next, we transfer words among the dictionaries, so that all the dictionaries may keep roughly the same number of words and acquire the descriptive power evenly. The application to real image classification shows that our method increases classification accuracy by up to 8% compared with the case without our method, which demonstrates that our approach to keep the dictionaries independent is effective. |
abstractGer |
This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). Specifically, we focus on the known framework called PRDC, which represents an object <i<x</i< as a compression-ratio vector (CV) that lines up the compression ratios after <i<x</i< is compressed with multiple different dictionaries. By representing an object <i<x</i< as a CV, PRDC makes it possible to apply vector-based pattern recognition techniques to the compression-based pattern recognition. For PRDC, the dimensions, i.e., the dictionaries determine the quality of the CV space. This paper presents a practical technique to modify the chosen dictionaries in order to improve the performance of pattern recognition substantially: First, in order to make the dictionaries independent from each other, our method leaves any word shared by multiple dictionaries in only one dictionary and assures that any pair of dictionaries have no common words. Next, we transfer words among the dictionaries, so that all the dictionaries may keep roughly the same number of words and acquire the descriptive power evenly. The application to real image classification shows that our method increases classification accuracy by up to 8% compared with the case without our method, which demonstrates that our approach to keep the dictionaries independent is effective. |
abstract_unstemmed |
This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). Specifically, we focus on the known framework called PRDC, which represents an object <i<x</i< as a compression-ratio vector (CV) that lines up the compression ratios after <i<x</i< is compressed with multiple different dictionaries. By representing an object <i<x</i< as a CV, PRDC makes it possible to apply vector-based pattern recognition techniques to the compression-based pattern recognition. For PRDC, the dimensions, i.e., the dictionaries determine the quality of the CV space. This paper presents a practical technique to modify the chosen dictionaries in order to improve the performance of pattern recognition substantially: First, in order to make the dictionaries independent from each other, our method leaves any word shared by multiple dictionaries in only one dictionary and assures that any pair of dictionaries have no common words. Next, we transfer words among the dictionaries, so that all the dictionaries may keep roughly the same number of words and acquire the descriptive power evenly. The application to real image classification shows that our method increases classification accuracy by up to 8% compared with the case without our method, which demonstrates that our approach to keep the dictionaries independent is effective. |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 |
container_issue |
6, p 301 |
title_short |
Editing Compression Dictionaries toward Refined Compression-Based Feature-Space |
url |
https://doi.org/10.3390/info13060301 https://doaj.org/article/a267bf29b93641b7afc5415e2f0aca28 https://www.mdpi.com/2078-2489/13/6/301 https://doaj.org/toc/2078-2489 |
remote_bool |
true |
author2 |
Shota Ouchi Yuji Nakajima |
author2Str |
Shota Ouchi Yuji Nakajima |
ppnlink |
654746753 |
callnumber-subject |
T - General Technology |
mediatype_str_mv |
c |
isOA_txt |
true |
hochschulschrift_bool |
false |
doi_str |
10.3390/info13060301 |
callnumber-a |
T58.5-58.64 |
up_date |
2024-07-04T01:14:46.622Z |
_version_ |
1803609111658496000 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ027322939</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240414202650.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/info13060301</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ027322939</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJa267bf29b93641b7afc5415e2f0aca28</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T58.5-58.64</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Hisashi Koga</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Editing Compression Dictionaries toward Refined Compression-Based Feature-Space</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper investigates how to construct a feature space for compression-based pattern recognition which judges the similarity between two objects <i<x</i< and <i<y</i< through the compression ratio to compress <i<x</i< with <i<y</i< (’s dictionary). Specifically, we focus on the known framework called PRDC, which represents an object <i<x</i< as a compression-ratio vector (CV) that lines up the compression ratios after <i<x</i< is compressed with multiple different dictionaries. By representing an object <i<x</i< as a CV, PRDC makes it possible to apply vector-based pattern recognition techniques to the compression-based pattern recognition. For PRDC, the dimensions, i.e., the dictionaries determine the quality of the CV space. This paper presents a practical technique to modify the chosen dictionaries in order to improve the performance of pattern recognition substantially: First, in order to make the dictionaries independent from each other, our method leaves any word shared by multiple dictionaries in only one dictionary and assures that any pair of dictionaries have no common words. Next, we transfer words among the dictionaries, so that all the dictionaries may keep roughly the same number of words and acquire the descriptive power evenly. The application to real image classification shows that our method increases classification accuracy by up to 8% compared with the case without our method, which demonstrates that our approach to keep the dictionaries independent is effective.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">compression-based pattern recognition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">data compression</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">feature space</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">compression dictionary</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information technology</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Shota Ouchi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yuji Nakajima</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Information</subfield><subfield code="d">MDPI AG, 2010</subfield><subfield code="g">13(2022), 6, p 301</subfield><subfield code="w">(DE-627)654746753</subfield><subfield code="w">(DE-600)2599790-7</subfield><subfield code="x">20782489</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:13</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:6, p 301</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/info13060301</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/a267bf29b93641b7afc5415e2f0aca28</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/2078-2489/13/6/301</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2078-2489</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">13</subfield><subfield code="j">2022</subfield><subfield code="e">6, p 301</subfield></datafield></record></collection>
|
score |
7.4007587 |