Zobrazeno 1 - 10
of 1 436
pro vyhledávání: '"Random indexing"'
Autor:
Klåvus, Carl Henrik
This thesis presents an algorithm incorporating pattern grammar with random indexing to solve three English synonym benchmarks. A pattern grammar model and a baseline random indexing implementation benchmarked the solution. The results show an signif
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-345839
Autor:
Singh, Yashank, Chatterjee, Niladri
The present paper explores a novel variant of Random Indexing (RI) based representations for encoding language data with a view to using them in a dynamic scenario where events are happening in a continuous fashion. As the size of the representations
Externí odkaz:
http://arxiv.org/abs/2008.12552
Autor:
Orrenius, Axel, Wiebe Werner, Axel
The field of personalized product recommendation systems has seen tremendous growth in recent years. The usefulness of the algorithms’ abilities to filter out data from vast sets has been shown to be crucial in today’s information-heavy online ex
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-320114
Publikováno v:
In Egyptian Informatics Journal July 2019 20(2):117-130
Random Indexing is a simple implementation of Random Projections with a wide range of applications. It can solve a variety of problems with good accuracy without introducing much complexity. Here we use it for identifying the language of text samples
Externí odkaz:
http://arxiv.org/abs/1412.7026
Publikováno v:
In Computer Speech & Language January 2015 29(1):32-44
Publikováno v:
Egyptian Informatics Journal, Vol 20, Iss 2, Pp 117-130 (2019)
Web Proxy caching system is an intermediary between the Web users and servers that try to alleviate the loads on the origin servers by caching particular Web objects and behaves as the proxy for the server and services the requests that are made to t
Externí odkaz:
https://doaj.org/article/4784c034f56440a28606ba2e9969565c
Random Indexing (RI) K-tree is the combination of two algorithms for clustering. Many large scale problems exist in document clustering. RI K-tree scales well with large inputs due to its low complexity. It also exhibits features that are useful for
Externí odkaz:
http://arxiv.org/abs/1001.0833
Autor:
Orrenius, Axel, Wiebe Werner, Axel
The field of personalized product recommendation systems has seen tremendous growth in recent years. The usefulness of the algorithms’ abilities to filter out data from vast sets has been shown to be crucial in today’s information-heavy online ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______260::a2a910e29f40b72f8d553e3af8b18f6e
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-320114
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-320114
Publikováno v:
In The Journal of Systems & Software January 2013 86(1):2-11