Filters








18,804 Hits in 1.7 sec

Power of human-algorithm collaboration in solving combinatorial optimization problems [article]

Tapani Toivonen
2021 arXiv   pre-print
up to a multiplicative factor ϵ where ϵ is arbitrary constant.  ...  We show that if a polynomial time algorithm can query informative Gaussian priors from an expert poly(n) times, then a class of combinatorial optimization problems can be solved efficiently in expectation  ...  ) poly(n) ), can be solved efficiently up to an arbitrary multiplicative factor if the algorithm can query Gaussian priors from a human expert during the execution.  ... 
arXiv:2107.11784v1 fatcat:dqkdmm5zjjexbpooxgqqcqeuxi

Probabilistic drug connectivity mapping

Juuso A Parkkinen, Samuel Kaski
2014 BMC Bioinformatics  
This can be viewed as an information retrieval task, with the goal of finding the most relevant profiles for a given query drug.  ...  The aim of connectivity mapping is to match drugs using drug-treatment gene expression profiles from multiple cell lines.  ...  Acknowledgements We'd like to thank Suleiman A. Khan for his useful discussions and insights.  ... 
doi:10.1186/1471-2105-15-113 pmid:24742351 pmcid:PMC4011783 fatcat:mbxzgdvc6jgx3l6i47jufpcvqi

Generalizing preference elicitation in combinatorial auctions

Benoît Hudson, Tuomas Sandholm
2003 Proceedings of the second international joint conference on Autonomous agents and multiagent systems - AAMAS '03  
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items.  ...  This paper evaluates several approaches and finds that in many cases, automated elicitation is in fact beneficial: as the number of items for sale increases, the amount of information elicited is a small  ...  Our experiments show that only a very small fraction of the bidders' preference information needs to be elicited in order to determine the provably optimal allocation and the VCG payments.  ... 
doi:10.1145/860575.860772 dblp:conf/atal/HudsonS03 fatcat:wjx37sglzne2va6ilikikkuyjm

Generalizing preference elicitation in combinatorial auctions

Benoît Hudson, Tuomas Sandholm
2003 Proceedings of the second international joint conference on Autonomous agents and multiagent systems - AAMAS '03  
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items.  ...  This paper evaluates several approaches and finds that in many cases, automated elicitation is in fact beneficial: as the number of items for sale increases, the amount of information elicited is a small  ...  Our experiments show that only a very small fraction of the bidders' preference information needs to be elicited in order to determine the provably optimal allocation and the VCG payments.  ... 
doi:10.1145/860722.860772 fatcat:zws2py5ajzghthzv7mm2urqjqu

Bayesian preference elicitation for multiobjective combinatorial optimization [article]

Nadjet Bourdache, Patrice Perny, Olivier Spanjaard
2020 arXiv   pre-print
The originality of the contribution is to propose a Bayesian approach for determining a preferred solution in a multiobjective decision problem involving a combinatorial set of alternatives.  ...  The query selection strategy is based on the solution of a mixed integer linear program with a combinatorial set of variables and constraints, which requires to use columns and constraints generation methods  ...  Our goal here is to fill the gap and to propose a Bayesian approach for determining a preferred solution in a multiobjective combinatorial optimization problem.  ... 
arXiv:2007.14778v1 fatcat:wn6u7ntocnfytg3ze6hvbmckmy

The Impact of Using Combinatorial Optimisation for Static Caching of Posting Lists [chapter]

Casper Petersen, Jakob Grue Simonsen, Christina Lioma
2015 Lecture Notes in Computer Science  
Thus, we cast the selection of posting lists for caching as an integer linear programming problem and perform a series of experiments using heuristics from combinatorial optimisation (CCO) to find optimal  ...  Caching posting lists can reduce the amount of disk I/O required to evaluate a query. Current methods use optimisation procedures for maximising the cache hit ratio.  ...  As the knapsack optimisation problem is NP-hard and cannot in general be solved optimally using a greedy strategy [7, Chap. 16], we next describe how to formulate posting list selection as a combinatorial  ... 
doi:10.1007/978-3-319-28940-3_36 fatcat:chi4y3bcmffpjmgrzordfenbg4

Annis3: Towards Generic Corpus Search And Visualization

Thomas Krause, Benjamin Weißenfels, Amir Zeldes, Florian Zipser
2015 Zenodo  
with aligned multilingual texts, quickly leads to a combinatorial explosion: each corpus requires unique search and visualization capabilities, and the overhead of designing the query system core and  ...  The problem of visualizing heterogeneous data is approached from two directions using an extensible plugin-based system. The system offers dedicated, highly optimize [...]  ...  the architecture for unique search and visualization applications Simplifying the query language (AQL) to deal with new structures Unified data model and query language Dealing with multiple source formats  ... 
doi:10.5281/zenodo.15639 fatcat:yrxpsu7lpnabfe4fbkheptl5mu

Comparing multiagent systems research in combinatorial auctions and voting

Vincent Conitzer
2010 Annals of Mathematics and Artificial Intelligence  
The aim of this paper is to give a convenient side-by-side comparison that will clarify the relation between the domains, and serve as a guide to future research.  ...  In a combinatorial auction, a set of resources is for sale, and agents can bid on subsets of these resources.  ...  One natural approach to identifying the "optimal" voting rule is to specify some axioms that such a rule should satisfy.  ... 
doi:10.1007/s10472-010-9205-y fatcat:7tbreanrrrhmjjorivhzzaow6a

Machine Learning over Static and Dynamic Relational Data [article]

Ahmet Kara, Milos Nikolic, Dan Olteanu, Haozhe Zhang
2021 arXiv   pre-print
The tutorial has the following parts: 1) Database research for data science 2) Three main ideas to achieve performance improvements 2.1) Turn the ML problem into a DB problem 2.2) Exploit structure of  ...  the data and problem 2.3) Exploit engineering tools of a DB researcher 3) Avenues for future research  ...  Combinatorial structure. The combinatorial structure prevalent in relational data is captured by notions such as the width measure of the query and the degree of a data value.  ... 
arXiv:2107.13923v1 fatcat:tutcaoxu2jayxilaufkgbzetxm

The Power of Human–Algorithm Collaboration in Solving Combinatorial Optimization Problems

Tapani Toivonen, Markku Tukiainen
2021 Algorithms  
to a multiplicative factor ϵ, where ϵ is arbitrary constant.  ...  Our methods can cast new light on how to approach optimization problems in domains where even the approximation of the problem is not feasible.  ...  (n) poly(n) ), can be solved efficiently up to an arbitrary multiplicative factor , if the algorithm can query Gaussian priors from a human expert Bayesian Optimization Global optimization (GO) aims  ... 
doi:10.3390/a14090253 fatcat:7zpdkbbcwrc2leymk34fdn6l7a

Concept based design of data warehouses

M. Jarke, C. Quix, D. Calvanese, M. Lenzerini, E. Franconi, S. Ligoudistianos, P. Vassiliadis, Y. Vassiliou
2000 Proceedings of the 2000 ACM SIGMOD international conference on Management of data - SIGMOD '00  
This is complemented by quantitative optimization techniques for view materialization, optimizing timeliness and responsiveness without losing the semantic advantages from the conceptual approach.  ...  At the operational level, query rewriting and materialization refreshment algorithms exploit the knowledge developed at design time.  ...  We demonstrate a combinatorial optimization algorithm for solving this problem [4] . 6.  ... 
doi:10.1145/342009.336570 dblp:conf/sigmod/JarkeQCLFLVV00 fatcat:psm4flhe7rckhartotvordvgmi

Comparing Performance of Various Optimization Algorithms for Effective Information Retrieval – A Review

Tahera Shaikh
2017 International Journal for Research in Applied Science and Engineering Technology  
Because of the semantic disconnect between query and documents, IR is accountable to return a lot of unwanted items.  ...  The paper compares the various optimization algorithms like Accelerated Particle Swarm intelligence algorithm (APSO) and Bat algorithm, Ant Colony Optimization (ACO) , Artificial Bee Colony (ABC) and Genetic  ...  The author described the description and methodology used for optimization algorithms and the paper also mentions demerits to be considered before doing any implementation and research on mentioned algorithms  ... 
doi:10.22214/ijraset.2017.11117 fatcat:jid23wuawvh2zk5cclg5bjt37y

New kids on the block: novel informatics methods for natural product discovery

Franziska Hufsky, Kerstin Scheubert, Sebastian Böcker
2014 Natural product reports (Print)  
Furthermore, when a potential drug lead has been determined, these tools may help to identify it and elucidate its structure.  ...  Mass spectrometry is a key technology for the identication and structural elucidation of natural products.  ...  The presented approaches rely on established computational techniques, most notably machine learning and combinatorial optimization.  ... 
doi:10.1039/c3np70101h pmid:24752343 fatcat:irgbxvk3kbbujhtupxpahpe7xu

ChemDB update full-text search and virtual chemical space

J. H. Chen, E. Linstead, S. J. Swamidass, D. Wang, P. Baldi
2007 Bioinformatics  
Recent developments include optimization of chemical structure (and substructure) retrieval algorithms, enabling full database searches in less than a second.  ...  The data is publicly available over the web for download and for targeted searches using a variety of powerful methods.  ...  ACKNOWLEDGEMENTS Work supported by an NIH Biomedical Informatics Training grant (LM-07443-01) and NSF grants EIA-0321390 and 0513376 to P.B.  ... 
doi:10.1093/bioinformatics/btm341 pmid:17599932 fatcat:dc4dx3plangmliqry5wyy4bace

Exploring the Unexplored: Identifying Implicit and Indirect Descriptions of Biomedical Terminologies Based on Multifaceted Weighting Combinations

Sung-Pil Choi
2016 Computational and Mathematical Methods in Medicine  
Combinatorial weighting schemes are proposed as an initial approach to this problem, which utilize various indexing and weighting methods and their combinations.  ...  In order to achieve relevant scholarly information from the biomedical databases, researchers generally use technical terms as queries such as proteins, genes, diseases, and other biomedical descriptors  ...  of the combinatorial approaches proposed in this paper.  ... 
doi:10.1155/2016/1637580 pmid:27698678 pmcid:PMC5029054 fatcat:rubgomr7hzaynhuglr7nadwhse
« Previous Showing results 1 — 15 out of 18,804 results