Information Retrieval
Accelerating Innovation Through Analogy Mining
Hope, Tom, Chan, Joel, Kittur, Aniket, Shahaf, Dafna
The availability of large idea repositories (e.g., the U.S. patent database) could significantly accelerate innovation and discovery by providing people with inspiration from solutions to analogous problems. However, finding useful analogies in these large, messy, real-world repositories remains a persistent challenge for either human or automated methods. Previous approaches include costly hand-created databases that have high relational structure (e.g., predicate calculus representations) but are very sparse. Simpler machine-learning/information-retrieval similarity metrics can scale to large, natural-language datasets, but struggle to account for structural similarity, which is central to analogy. In this paper we explore the viability and value of learning simpler structural representations, specifically, "problem schemas", which specify the purpose of a product and the mechanisms by which it achieves that purpose. Our approach combines crowdsourcing and recurrent neural networks to extract purpose and mechanism vector representations from product descriptions. We demonstrate that these learned vectors allow us to find analogies with higher precision and recall than traditional information-retrieval methods. In an ideation experiment, analogies retrieved by our models significantly increased people's likelihood of generating creative ideas compared to analogies retrieved by traditional methods. Our results suggest a promising approach to enabling computational analogy at scale is to learn and leverage weaker structural representations.
Introductory Guide To Excel
This article is contributed by Atiq Rehman. It was initially intended for SEO people, though many will find it useful. For each one we've included a simple SEO based example of it in use. We've also included notes on it's uses for day-to-day SEO work and a link or two to useful more technical articles. There is also an appendix.
Artificial Intelligence and the Future of Search Engines
It was not long ago that Artificial Intelligence (AI) was only in the realm of science fiction. Today, it has become a reality and is only growing more prominent in many different industries every day. This includes the internet as AI in search engine technology has been around for a few years. The algorithms used to rank pages have been affected considerably by AI already and that trend will continue into the foreseeable future. Currently, Google's RankBrain, an AI process used help set search engine rankings, is having a major impact which is only expected to expand.
Learning to Speed Up Query Planning in Graph Databases
Namaki, Mohammad Hossain (Washington State University, Pullman) | Chowdhury, F. A. Rezaur Rahman (Washington State University, Pullman) | Islam, Md Rakibul (Washington State University, Pullman) | Doppa, Janardhan Rao (Washington State University, Pullman) | Wu, Yinghui (Washington State University, Pullman)
Querying graph structured data is a fundamental operation that enables important applications including knowledge graph search, social network analysis, and cyber-network security. However, the growing size of real-world data graphs poses severe challenges for graph databases to meet the response-time requirements of the applications. Planning the computational steps of query processing โ Query Planning โ is central to address these challenges. In this paper, we study the problem of learning to speedup query planning in graph databases towards the goal of improving the computational-efficiency of query processing via training queries. We present a Learning to Plan (L2P) framework that is applicable to a large class of query reasoners that follow the Threshold Algorithm (TA) approach. First, we define a generic search space over candidate query plans, and identify target search trajectories (query plans) corresponding to the training queries by performing an expensive search. Subsequently, we learn greedy search control knowledge to imitate the search behavior of the target query plans. We provide a concrete instantiation of our L2P framework for STAR, a state-of-the-art graph query reasoner. Our experiments on benchmark knowledge graphs including dbpedia, yago, and freebase show that using the query plans generated by the learned search control knowledge, we can significantly improve the speed of STAR with negligible loss in accuracy.
Amazon rejects AI2's Alexa skill voice-search engine. Will it build one?
Surprisingly, Amazon Alexa doesn't have a good way to search for Alexa skills by voice. You can't say that you want to play word games, need a skill to check airport security wait times, or feel like meditating. Alexa doesn't know what to tell you. Amazon released its own "Skill Finder" skill last year, but it's a bare-bones experience that can only read off the most popular apps in certain vague categories, or list the top or newest Alexa skills. You can't ask it for a skill with a specific use case or functionality.
Sharing Hash Codes for Multiple Purposes
Pronobis, Wikor, Panknin, Danny, Kirschnick, Johannes, Srinivasan, Vignesh, Samek, Wojciech, Markl, Volker, Kaul, Manohar, Mueller, Klaus-Robert, Nakajima, Shinichi
Locality sensitive hashing (LSH) is a powerful tool for sublinear-time approximate nearest neighbor search, and a variety of hashing schemes have been proposed for different dissimilarity measures. However, hash codes significantly depend on the dissimilarity, which prohibits users from adjusting the dissimilarity at query time. In this paper, we propose {multiple purpose LSH (mp-LSH) which shares the hash codes for different dissimilarities. mp-LSH supports L2, cosine, and inner product dissimilarities, and their corresponding weighted sums, where the weights can be adjusted at query time. It also allows us to modify the importance of pre-defined groups of features. Thus, mp-LSH enables us, for example, to retrieve similar items to a query with the user preference taken into account, to find a similar material to a query with some properties (stability, utility, etc.) optimized, and to turn on or off a part of multi-modal information (brightness, color, audio, text, etc.) in image/video retrieval. We theoretically and empirically analyze the performance of three variants of mp-LSH, and demonstrate their usefulness on real-world data sets.
Towards Better Response Times and Higher-Quality Queries in Interactive Knowledge Base Debugging
Many AI applications rely on knowledge encoded in a locigal knowledge base (KB). The most essential benefit of such logical KBs is the opportunity to perform automatic reasoning which however requires a KB to meet some minimal quality criteria such as consistency. Without adequate tool assistance, the task of resolving such violated quality criteria in a KB can be extremely hard, especially when the problematic KB is large and complex. To this end, interactive KB debuggers have been introduced which ask a user queries whether certain statements must or must not hold in the intended domain. The given answers help to gradually restrict the search space for KB repairs. Existing interactive debuggers often rely on a pool-based strategy for query computation. A pool of query candidates is precomputed, from which the best candidate according to some query quality criterion is selected to be shown to the user. This often leads to the generation of many unnecessary query candidates and thus to a high number of expensive calls to logical reasoning services. We tackle this issue by an in-depth mathematical analysis of diverse real-valued active learning query selection measures in order to determine qualitative criteria that make a query favorable. These criteria are the key to devising efficient heuristic query search methods. The proposed methods enable for the first time a completely reasoner-free query generation for interactive KB debugging while at the same time guaranteeing optimality conditions, e.g. minimal cardinality or best understandability for the user, of the generated query that existing methods cannot realize. Further, we study different relations between active learning measures. The obtained picture gives a hint about which measures are more favorable in which situation or which measures always lead to the same outcomes, based on given types of queries.
Machine Intelligence: The Evolution of Machine Learning - Data Natives 2016
Francisco is the Founder and CEO of cortical.io, Francisco's medical background in genetics combined with over two decade's of experience in Information Technology, inspired him to create a groundbreaking technology, called Semantic Folding, which is based on the latest findings on the way the human neocortex processes information. Francisco founded Matrixware Information Services, a company that developed the first standardized database of patents. Francisco also initiated the Information Retrieval Facility, a non-profit research institute, with the goal to bridge the gap between science and industry in the information retrieval domain. Let me introduce you to Francisco Webber, Founder and CEO of cortical.io.
How Will AI Change SEO in 2017? [Video]
In this new episode of Real Smart Marketing, we've asked this big question to 4 of our favorite influencers. If you're like me, the first thing that comes to mind when you hear AI might be this: But as I've come to realize, what we're talking about is a lot less creepy. AI is changing the face of SEO, but not like that. We're talking about algorithms that enable machines to make connections and "learn" to process data and apply its learning in future tasks. Basically, improvements in artificial intelligence like deep learning and natural language processing mean that search engines are becoming smarter and more human-friendly.