?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=Binding+and+Normalization+of+Binary+Sparse+Distributed+Representations+by+Context-Dependent+Thinning&rft.creator=Rachkovskij%2C+Dmitri+A.&rft.creator=Kussul%2C+Ernst+M.&rft.subject=Artificial+Intelligence&rft.subject=Neural+Nets&rft.description=Distributed+representations+were+often+criticized+as+inappropriate+for+encoding+of+data+with+a+complex+structure.+However+Plate's+Holographic+Reduced+Representations+and+Kanerva's+Binary+Spatter+Codes+are+recent+schemes+that+allow+on-the-fly+encoding+of+nested+compositional+structures+by+real-valued+or+dense+binary+vectors+of+fixed+dimensionality.%0AIn+this+paper+we+consider+procedures+of+the+Context-Dependent+Thinning+which+were+developed+for+representation+of+complex+hierarchical+items+in+the+architecture+of+Associative-Projective+Neural+Networks.+These+procedures+provide+binding+of+items+represented+by+sparse+binary+codevectors+(with+low+probability+of+1s).+Such+an+encoding+is+biologically+plausible+and+allows+a+high+storage+capacity+of+distributed+associative+memory+where+the+codevectors+may+be+stored.%0AIn+contrast+to+known+binding+procedures%2C+Context-Dependent+Thinning+preserves+the+same+low+density+(or+sparseness)+of+the+bound+codevector+for+varied+number+of+component+codevectors.+Besides%2C+a+bound+codevector+is+not+only+similar+to+another+one+with+similar+component+codevectors+(as+in+other+schemes)%2C+but+it+is+also+similar+to+the+component+codevectors+themselves.+This+allows+the+similarity+of+structures+to+be+estimated+just+by+the+overlap+of+their+codevectors%2C+without+retrieval+of+the+component+codevectors.+This+also+allows+an+easy+retrieval+of+the+component+codevectors.%0AExamples+of+algorithmic+and+neural-network+implementations+of+the+thinning+procedures+are+considered.+We+also+present+representation+examples+for+various+types+of+nested+structured+data+(propositions+using+role-filler+and+predicate-arguments+representation+schemes%2C+trees%2C+directed+acyclic+graphs)+using+sparse+codevectors+of+fixed+dimension.+Such+representations+may+provide+a+fruitful+alternative+to+the+symbolic+representations+of+traditional+AI%2C+as+well+as+to+the+localist+and+microfeature-based+connectionist+representations.%0A&rft.date=2001-02&rft.type=Journal+(Paginated)&rft.type=PeerReviewed&rft.format=application%2Fpdf&rft.identifier=http%3A%2F%2Fcogprints.org%2F1240%2F1%2Fcdt-1sp.pdf&rft.format=application%2Fpostscript&rft.identifier=http%3A%2F%2Fcogprints.org%2F1240%2F5%2Fcdt-1sp.ps&rft.identifier=++Rachkovskij%2C+Dmitri+A.+and+Kussul%2C+Ernst+M.++(2001)+Binding+and+Normalization+of+Binary+Sparse+Distributed+Representations+by+Context-Dependent+Thinning.++%5BJournal+(Paginated)%5D+++++&rft.relation=http%3A%2F%2Fcogprints.org%2F1240%2F