CLUSTERING PROCESSOR, CLUSTERING PROCESSING METHOD AND PROGRAM
PROBLEM TO BE SOLVED: To reduce memory consumption in a system for reducing a distance calculation amount of k-Means on the basis of a triangle inequality, and to quicken inter-vector distance calculation.SOLUTION: A clustering processor includes: data compression means for compressing data relating...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | ONIZUKA MAKOTO FUKUMOTO KEISHI |
description | PROBLEM TO BE SOLVED: To reduce memory consumption in a system for reducing a distance calculation amount of k-Means on the basis of a triangle inequality, and to quicken inter-vector distance calculation.SOLUTION: A clustering processor includes: data compression means for compressing data relating to a distance, and for storing the compressed distance data in a memory; data-for-distance calculation cache means for calculating a non-zero index list and a Bloom filter about an input vector and a centroid vector as the object of distance calculation, and for storing the non-zero index list and Bloom filter in a memory; and vector distance calculation means for performing the omission determination of distance calculation by using the distance data compressed by the data compression means, for performing distance calculation when the distance calculation is not omitted by using the non-zero index list and the Bloom filter, and for calculating a most neighboring centroid vector with respect to the input vector. |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_JP2013218636A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>JP2013218636A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_JP2013218636A3</originalsourceid><addsrcrecordid>eNrjZLBz9gkNDnEN8vRzVwgI8nd2DQ72D9JRwBQFMX1dQzz8XRQc_VxAou5Bjr48DKxpiTnFqbxQmptByc01xNlDN7UgPz61uCAxOTUvtSTeK8DIwNDYyNDCzNjM0ZgoRQDggiru</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>CLUSTERING PROCESSOR, CLUSTERING PROCESSING METHOD AND PROGRAM</title><source>esp@cenet</source><creator>ONIZUKA MAKOTO ; FUKUMOTO KEISHI</creator><creatorcontrib>ONIZUKA MAKOTO ; FUKUMOTO KEISHI</creatorcontrib><description>PROBLEM TO BE SOLVED: To reduce memory consumption in a system for reducing a distance calculation amount of k-Means on the basis of a triangle inequality, and to quicken inter-vector distance calculation.SOLUTION: A clustering processor includes: data compression means for compressing data relating to a distance, and for storing the compressed distance data in a memory; data-for-distance calculation cache means for calculating a non-zero index list and a Bloom filter about an input vector and a centroid vector as the object of distance calculation, and for storing the non-zero index list and Bloom filter in a memory; and vector distance calculation means for performing the omission determination of distance calculation by using the distance data compressed by the data compression means, for performing distance calculation when the distance calculation is not omitted by using the non-zero index list and the Bloom filter, and for calculating a most neighboring centroid vector with respect to the input vector.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2013</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20131024&DB=EPODOC&CC=JP&NR=2013218636A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20131024&DB=EPODOC&CC=JP&NR=2013218636A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>ONIZUKA MAKOTO</creatorcontrib><creatorcontrib>FUKUMOTO KEISHI</creatorcontrib><title>CLUSTERING PROCESSOR, CLUSTERING PROCESSING METHOD AND PROGRAM</title><description>PROBLEM TO BE SOLVED: To reduce memory consumption in a system for reducing a distance calculation amount of k-Means on the basis of a triangle inequality, and to quicken inter-vector distance calculation.SOLUTION: A clustering processor includes: data compression means for compressing data relating to a distance, and for storing the compressed distance data in a memory; data-for-distance calculation cache means for calculating a non-zero index list and a Bloom filter about an input vector and a centroid vector as the object of distance calculation, and for storing the non-zero index list and Bloom filter in a memory; and vector distance calculation means for performing the omission determination of distance calculation by using the distance data compressed by the data compression means, for performing distance calculation when the distance calculation is not omitted by using the non-zero index list and the Bloom filter, and for calculating a most neighboring centroid vector with respect to the input vector.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2013</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLBz9gkNDnEN8vRzVwgI8nd2DQ72D9JRwBQFMX1dQzz8XRQc_VxAou5Bjr48DKxpiTnFqbxQmptByc01xNlDN7UgPz61uCAxOTUvtSTeK8DIwNDYyNDCzNjM0ZgoRQDggiru</recordid><startdate>20131024</startdate><enddate>20131024</enddate><creator>ONIZUKA MAKOTO</creator><creator>FUKUMOTO KEISHI</creator><scope>EVB</scope></search><sort><creationdate>20131024</creationdate><title>CLUSTERING PROCESSOR, CLUSTERING PROCESSING METHOD AND PROGRAM</title><author>ONIZUKA MAKOTO ; FUKUMOTO KEISHI</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_JP2013218636A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2013</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>ONIZUKA MAKOTO</creatorcontrib><creatorcontrib>FUKUMOTO KEISHI</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>ONIZUKA MAKOTO</au><au>FUKUMOTO KEISHI</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>CLUSTERING PROCESSOR, CLUSTERING PROCESSING METHOD AND PROGRAM</title><date>2013-10-24</date><risdate>2013</risdate><abstract>PROBLEM TO BE SOLVED: To reduce memory consumption in a system for reducing a distance calculation amount of k-Means on the basis of a triangle inequality, and to quicken inter-vector distance calculation.SOLUTION: A clustering processor includes: data compression means for compressing data relating to a distance, and for storing the compressed distance data in a memory; data-for-distance calculation cache means for calculating a non-zero index list and a Bloom filter about an input vector and a centroid vector as the object of distance calculation, and for storing the non-zero index list and Bloom filter in a memory; and vector distance calculation means for performing the omission determination of distance calculation by using the distance data compressed by the data compression means, for performing distance calculation when the distance calculation is not omitted by using the non-zero index list and the Bloom filter, and for calculating a most neighboring centroid vector with respect to the input vector.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_epo_espacenet_JP2013218636A |
source | esp@cenet |
subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
title | CLUSTERING PROCESSOR, CLUSTERING PROCESSING METHOD AND PROGRAM |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-31T00%3A23%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=ONIZUKA%20MAKOTO&rft.date=2013-10-24&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EJP2013218636A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |