Filters








14,990 Hits in 7.2 sec

Exploration of Interdisciplinarity in Nanotechnology Queries: The Use of Transaction Log Analysis and Thesauri

Ali Shiri
<span title="2009-11-16">2009</span> <i title="University of Washington Libraries"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rnocwf753ff2fazvnyyycsiwo4" style="color: black;">Advances in Classification Research Online</a> </i> &nbsp;
Exploration of interdisciplinarity in nanotechnology queries: The use of transaction log analysis and thesauri. 20th Annual ASIS  ...  Transaction logs of the digital library were analyzed to explore users' search behaviour patterns and to examine the extent to which user queries were interdisciplinary.  ...  Exploration of interdisciplinarity in nanotechnology queries: The use of transaction log analysis and thesauri. 20th Annual ASIS SIG/CR Workshop: Bridging Worlds, Connecting People: Classification Transcending  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7152/acro.v20i1.12883">doi:10.7152/acro.v20i1.12883</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jwibe2uhdze3jfy25hizbbrqea">fatcat:jwibe2uhdze3jfy25hizbbrqea</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721190032/https://journals.lib.washington.edu/index.php/acro/article/download/12883/11379" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/67/a7/67a7a64e0330d82413edc27b3504bf818bf5c7a0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7152/acro.v20i1.12883"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

YELL/TELL: online community platform for teacher professional development [chapter]

Ivana Marenzi, Maria Bortoluzzi, Rishita Kalyani
<span title="2016-12-18">2016</span> <i title="Research-publishing.net"> CALL communities and culture – short papers from EUROCALL 2016 </i> &nbsp;
We compare the evidence of the teachers' actions, with the analysis of their perception about their professional use of the online environment and their critical reflection about the experience.  ...  white) Print on demand technology is a high-quality, innovative and ecological printing method; with which the book is never 'out of stock' or 'out of print'.  ...  A quantitative analysis of the logs showed that teachers issued 840 search queries across the search types Image, Web and Video.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14705/rpnet.2016.eurocall2016.580">doi:10.14705/rpnet.2016.eurocall2016.580</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mo3wjm3ey5gl7cphnbqyfdyteq">fatcat:mo3wjm3ey5gl7cphnbqyfdyteq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190429024407/https://air.uniud.it/retrieve/handle/11390/1110205/136693/Marenzi-Bortoluzzi-Kalyani-EUROCALL2016.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/65/6e/656eb04b626c599dddb9f474299b47a165b21d1c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14705/rpnet.2016.eurocall2016.580"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Fast Neighborhood Graph Search Using Cartesian Concatenation

Jing Wang, Jingdong Wang, Gang Zeng, Rui Gan, Shipeng Li, Baining Guo
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/753trptklbb4nj6jquqadzwwdu" style="color: black;">2013 IEEE International Conference on Computer Vision</a> </i> &nbsp;
This structure augments the neighborhood graph with a bridge graph.  ...  Each bridge vector is connected with a few reference vectors near to it, forming a bridge graph.  ...  Acknowledgements The research work of Jing Wang, Gang Zeng and Rui Gan is supported by National Nature Science Foundation of China (NSFC Grant) 61375022, 61005037 and 90920304.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iccv.2013.265">doi:10.1109/iccv.2013.265</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/iccv/WangWZGLG13.html">dblp:conf/iccv/WangWZGLG13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oragncsqnna6hfmhshyey5zcs4">fatcat:oragncsqnna6hfmhshyey5zcs4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161020103732/http://www.cv-foundation.org:80/openaccess/content_iccv_2013/papers/Wang_Fast_Neighborhood_Graph_2013_ICCV_paper.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/29/57/29571688347d6d5b04bf1b205f112afd8762ebec.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iccv.2013.265"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Fast Neighborhood Graph Search Using Cartesian Concatenation [chapter]

Jingdong Wang, Jing Wang, Gang Zeng, Rui Gan, Shipeng Li, Baining Guo
<span title="">2015</span> <i title="Springer International Publishing"> Multimedia Data Mining and Analytics </i> &nbsp;
This structure augments the neighborhood graph with a bridge graph.  ...  Each bridge vector is connected with a few reference vectors near to it, forming a bridge graph.  ...  Acknowledgements The research work of Jing Wang, Gang Zeng and Rui Gan is supported by National Nature Science Foundation of China (NSFC Grant) 61375022, 61005037 and 90920304.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-14998-1_18">doi:10.1007/978-3-319-14998-1_18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ietijsct7vg7fnxbw5hqneyofi">fatcat:ietijsct7vg7fnxbw5hqneyofi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161020103732/http://www.cv-foundation.org:80/openaccess/content_iccv_2013/papers/Wang_Fast_Neighborhood_Graph_2013_ICCV_paper.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/29/57/29571688347d6d5b04bf1b205f112afd8762ebec.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-14998-1_18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Crossover phenomenon in the performance of an Internet search engine [article]

Lucas Lacasa, Jacopo Tagliabue, Andrew Berdahl
<span title="2012-05-07">2012</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We finally speculate on the possible connections to Ramsey theory.  ...  These random strings, dense over the set of possible N-letter words, address the existence of typos, acronyms, and other words without semantic meaning.  ...  Acknowledgments The authors would like to acknowledge generous support from the National Science Foundation, the Santa Fe Institute and grants FIS2009-13690 and S2009ESP-1691.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1205.1505v1">arXiv:1205.1505v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b4k26jecwbfnhit77jaepzg7ae">fatcat:b4k26jecwbfnhit77jaepzg7ae</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1205.1505/1205.1505.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1205.1505v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

HCIR 2009

Bill Kules, Daniel Tunkelang, Ryen W. White
<span title="2009-12-14">2009</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/emlsu7gwyfalfms3c35odq5qlm" style="color: black;">SIGIR Forum</a> </i> &nbsp;
The event brought together representatives from academia, industry, and government to discuss research, present work in process, and advance ideas in the area of HCIR.  ...  The workshop attracted over 50 participants from across the world and was the largest HCIR workshop to date.  ...  The next HCIR Workshop will be co-located with the 2010 Information Interaction in Context Symposium (IIiX 2010), on Sunday, August 22, 2010, in New Brunswick, NJ, USA. We hope to see you there!  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1670564.1670580">doi:10.1145/1670564.1670580</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ktz4evh4ijh5zbg6mefgy6qfm4">fatcat:ktz4evh4ijh5zbg6mefgy6qfm4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808095803/http://cuaslis.org/hcir2009/HCIR2009Report.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/32/da/32dad5af297c0bf78d3bc2c2145bf3bd45d676ad.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1670564.1670580"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> acm.org </button> </a>

Lazy Search Trees [article]

Bryce Sandlund, Sebastian Wild
<span title="2020-10-17">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
A query falls into a particular gap and splits the gap into two new gaps at a rank r associated with the query operation.  ...  Over a sequence of n insertions and q queries, a time bound of O(n log q + q log n) holds; better bounds are possible when queries are non-uniformly distributed.  ...  Acknowledgements The authors of this paper would like to thank Ian Munro, Kevin Wu, Lingyi Zhang, Yakov Nekrich, and Meng He for useful discussions on the topics of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2010.08840v1">arXiv:2010.08840v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/he4ofv2bdzfqtdyocia7fxbhhy">fatcat:he4ofv2bdzfqtdyocia7fxbhhy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201024233427/https://arxiv.org/pdf/2010.08840v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7b/ed/7bed8b0de13ce835506c41d7b7b26d1d9516568c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2010.08840v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Ontology: Core Process Mining and Querying Enabling Tool [chapter]

Kingsley Okoye, Syed Islam, Usman Naeem
<span title="2018-03-08">2018</span> <i title="InTech"> Ontology in Information Science </i> &nbsp;
querying and improved analysis of the resulting models through semantic labelling (annotation), semantic representation (ontology) and semantic reasoning (reasoner).  ...  The ontological schema enables for automated querying and inference of useful knowledge from the different domain processes.  ...  analysis and querying process.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5772/intechopen.71981">doi:10.5772/intechopen.71981</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/74wy2pqheva7fdkmdj4f47tf3u">fatcat:74wy2pqheva7fdkmdj4f47tf3u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200310012939/https://api.intechopen.com/chapter/pdf-download/58727.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a5/cb/a5cb826bf953d612a0be9e46cfbbd3031b7a57d6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5772/intechopen.71981"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Introduction to the TPLP special issue, logic programming in databases: From Datalog to semantic-web rules

GIORGIO ORSI, LETIZIA TANCA
<span title="">2010</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yhwvj6mbzza5tfz766tokherka" style="color: black;">Theory and Practice of Logic Programming</a> </i> &nbsp;
Logic has been a common ground where Database and Artificial Intelligence research competed and collaborated with each other for a long time (Abiteboulet al. 1995).  ...  Much has happened in data and knowledge base research since the introduction of the relational model in Codd (1970) and its strong logical foundations influence its advances ever since.  ...  and its extensions, along with many related implementations and applications.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068410000086">doi:10.1017/s1471068410000086</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2zi7w5eejvanpknuncdy6qmw2e">fatcat:2zi7w5eejvanpknuncdy6qmw2e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190415081358/https://core.ac.uk/download/pdf/55208383.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cc/b8/ccb88221eaf7167c241b56b519082aa5d9bc315e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068410000086"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

Sparse ternary codes for similarity search have higher coding gain than dense binary codes

Sohrab Ferdowsi, Slava Voloshynovskiy, Dimche Kostadinov, Taras Holotyak
<span title="">2017</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ux5tf45dtrgptnezraiii73msm" style="color: black;">2017 IEEE International Symposium on Information Theory (ISIT)</a> </i> &nbsp;
Instead, a properly designed ternary encoding achieves higher coding gains and lower complexity.  ...  While this analysis is based on the asymptotic assumption where the number of items M should grow exponentially with dimension n, it can be argued, however, that M is fixed in practice and can be even  ...  At the query time, the items are reconstructed from the codebooks and matched with the given query, usually using look-up-tables.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isit.2017.8007010">doi:10.1109/isit.2017.8007010</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/isit/FerdowsiVKH17.html">dblp:conf/isit/FerdowsiVKH17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vc2utzjoefaxjbz7chvnbnetfi">fatcat:vc2utzjoefaxjbz7chvnbnetfi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201107045237/https://archive-ouverte.unige.ch/files/downloads/0/0/0/9/4/0/2/6/unige_94026_attachment01.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b5/4f/b54f409b177b34df1f0712d6bedd15ff53a3f4ec.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isit.2017.8007010"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Learning equilibria of games via payoff queries

John Fearnley, Martin Gairing, Paul Goldberg, Rahul Savani
<span title="2013-06-16">2013</span> <i title="ACM"> Proceedings of the fourteenth ACM conference on Electronic commerce </i> &nbsp;
We study a corresponding computational learning model, and the query complexity of learning equilibria for various classes of games. We give basic results for bimatrix and graphical games.  ...  For directed acyclic networks, we can learn the cost functions (and hence compute an equilibrium) while querying just a small fraction of pure-strategy profiles.  ...  The binary search on q adds a factor log(km). Theorem 5.5. Algorithm ParallelLinks returns a pure Nash equilibrium and can be implemented with O log(n) · log 2 (m) log log(m) payoff queries. Proof.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2482540.2482558">doi:10.1145/2482540.2482558</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fph6fbfbhvag7kkc42liq4fypq">fatcat:fph6fbfbhvag7kkc42liq4fypq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813170403/http://www.cs.ox.ac.uk/people/paul.goldberg/papers/p397-fearnley.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6b/6e/6b6e373f86a3f3133d6b78bbe6815781e76e4b38.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2482540.2482558"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Fast Neighborhood Graph Search using Cartesian Concatenation [article]

Jingdong Wang, Jing Wang, Gang Zeng, Rui Gan, Shipeng Li, Baining Guo
<span title="2013-12-11">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This structure augments the neighborhood graph with a bridge graph.  ...  Each bridge vector is connected with a few reference vectors near to it, forming a bridge graph.  ...  The algorithm is very efficient and producing the t-th bridge vector only takes O(log(t)) time.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1312.3062v1">arXiv:1312.3062v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4eprr7ybcbgbjitskfm4wgskby">fatcat:4eprr7ybcbgbjitskfm4wgskby</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200824170858/https://arxiv.org/pdf/1312.3062v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/99/75/997548455d87e8452b8dc496f786a0ec2b864931.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1312.3062v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Understanding inverse document frequency: on theoretical arguments for IDF

Stephen Robertson
<span title="">2004</span> <i title="Emerald"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jz5kmxkrwzgd3idkcddqkkgkcm" style="color: black;">Journal of Documentation</a> </i> &nbsp;
Some of these attempts are reviewed, and it is shown that the Information Theory approaches are problematic, but that there are good theoretical justifications of both IDF and TF*IDF in traditional probabilistic  ...  It is often described as a heuristic, and many papers have been written (some based on Shannon's Information Theory) seeking to establish some theoretical basis for it.  ...  In these conditions, TF is not so important as it subsequently became with full-text documents.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1108/00220410410560582">doi:10.1108/00220410410560582</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a4igw4butjbzjnl45qxpkcgoaq">fatcat:a4igw4butjbzjnl45qxpkcgoaq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160411030327/https://wuawua.googlecode.com/files/Understanding%20Inverse%20Document%20Frequency%20On%20theoretical%20arguments%20for%20IDF.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/83/97/8397ab573dd6c97a39ff4feb9c2d9b3c1e16c705.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1108/00220410410560582"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Optimization Framework with Minimum Description Length Principle for Probabilistic Programming [chapter]

Alexey Potapov, Vita Batishcheva, Sergey Rodionov
<span title="">2015</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
It was shown that incorporation of this criterion is essential for optimization queries to behave similarly to more common queries performing sampling in accordance with posterior distributions and automatically  ...  Detection appeared to be possible using genetic programming query, and automatic penalization of candidate solution complexity allowed to choose the number of cells correctly avoiding overfitting.  ...  Acknowledgements This work was supported by Ministry of Education and Science of the Russian Federation, and by Government of Russian Federation, Grant 074-U01.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-21365-1_34">doi:10.1007/978-3-319-21365-1_34</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c66a32noyzhavpvzka36lit6em">fatcat:c66a32noyzhavpvzka36lit6em</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829194757/http://agi-conf.org/2015/wp-content/uploads/2015/07/agi15_potapov.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/54/81/54818a4049178458d37d05b2b9440e2675caa03c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-21365-1_34"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Applying Constraint Logic Programming to SQL Semantic Analysis

FERNANDO SÁENZ-PÉREZ
<span title="">2019</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yhwvj6mbzza5tfz766tokherka" style="color: black;">Theory and Practice of Logic Programming</a> </i> &nbsp;
in such queries.  ...  with respect to other approaches, as well as some performance data.  ...  Performance data show that the approach is practical, and well able to cope with queries that other systems cannot afford.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068419000206">doi:10.1017/s1471068419000206</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jwjr7bqscfcgdjmzg2p5kxsa6u">fatcat:jwjr7bqscfcgdjmzg2p5kxsa6u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200311055559/https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6D6EA734F415AE0D934EA6FE697E23E6/S1471068419000206a.pdf/div-class-title-applying-constraint-logic-programming-to-sql-semantic-analysis-div.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e2/2d/e22d3e1b35d94c9dd11dc54f2f565a774d1489bd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068419000206"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 14,990 results