首页> 外文学位 >Efficient exploration techniques on large databases.
【24h】

Efficient exploration techniques on large databases.

机译:大型数据库上的有效探索技术。

获取原文
获取原文并翻译 | 示例

摘要

Search, retrieval, and exploration of information have become some of the most intense and principal research challenges in many enterprize and e-commerce applications off late. The mainstay of this dissertation is to analyze and investigate different aspects of online data exploration, and propose techniques to accomplish them efficiently. In particular, the results in this dissertation widen the scope of existing faceted search and recommendation systems - two upcoming fields in data exploration which are still in their infancy.;Faceted search, the de facto standard for e-commerce applications, is an interface framework with the primary design goal of allowing users to explore large information spaces in a flexible manner. We study this alternative search and exploration paradigm in the context of structured and unstructured databases. More specifically, motivated by the rapid need of knowledge discovery and management in large enterprize organizations, we propose DynaCet, a minimum effort driven dynamic faceted search system on structured databases. In addition, we study the problem of dynamic faceted retrieval in the context of unstructured data using Wikipedia, the largest and most popular encyclopedia. We propose Facetedpedia, a faceted retrieval system which is capable of dynamically generating query-dependent facets for a set of Wikipedia articles.;The ever-expanding volume and increasing complexity of information on the web has made recommender systems essential tools for users in a variety of information seeking or e-commerce activities by exposing them to the most interesting items, and by offering novelty, diversity, and relevance. Current research suggests that there exists an increasing growth in online social activities that leaves behind trails of information created by users. Interestingly, recommendation tasks stand to benefit immensely by tapping into these latent information sources, and by following those trails. A significant part of this dissertation has investigated on how to improve the online recommendation tasks with novel functionalities by considering additional contexts that can be leveraged by tapping into social data.;To this end, this dissertation investigates problems such as, how to compute recommendation for a group of users, or how to recommend composite items to a user. Underlying models leverage on social data (co-purchase or browsing histories, social book-marking of photos) to derive additional contexts to accomplish those recommendation tasks. In particular, it focuses on techniques that enable a recommendation system to interact with the user in suggesting composite items - such as, bundled products in online shopping, or itinerary planning for vacation travel. We investigate the technical and algorithmic challenges involved in enabling efficient recommendation computation, both from the user (the interaction should be easy, and should converge quickly), as well as the system (efficient computation) points of view.;This dissertation also discusses extensive performance and user study results, which were conducted using the crowd-sourcing platform Amazon Mechanical Turk. We conclude by briefly describing other promising problems with future opportunities in this field.
机译:信息搜索,检索和探索已成为许多企业和电子商务应用中最近出现的最激烈和最主要的研究挑战。本文的主要工作是分析和研究在线数据探索的各个方面,并提出有效实现这些技术的技术。特别是,本论文的结果拓宽了现有多面搜索和推荐系统的范围-数据探索中的两个即将出现的领域仍处于起步阶段。面向对象的搜索是电子商务应用程序的事实上的标准,是一个接口框架其主要设计目标是允许用户灵活地探索大型信息空间。我们在结构化和非结构化数据库的背景下研究这种替代的搜索和探索范例。更具体地说,受大型企业组织对知识发现和管理快速需求的推动,我们提出了DynaCet,这是一种最少的精力驱动的结构化数据库上的动态多面搜索系统。此外,我们使用最大,最受欢迎的百科全书Wikipedia研究非结构化数据情况下的动态多面检索问题。我们提出了Facetedpedia,这是一种多面面检索系统,能够为一组Wikipedia文章动态生成与查询相关的方面。;网络上信息量的不断增长和日益复杂使推荐系统成为各种用户的必备工具通过将信息搜索或电子商务活动暴露于最有趣的项目并提供新颖性,多样性和相关性来实现。当前的研究表明,在线社交活动的增长正在不断增加,从而留下了用户创建的信息线索。有趣的是,通过挖掘这些潜在信息源并遵循这些线索,推荐任务将受益匪浅。本论文的重要部分研究了如何通过考虑可以利用社会数据来利用的其他上下文来改进具有新颖功能的在线推荐任务。为此,本论文研究了诸如如何计算推荐量的问题。一组用户,或如何向用户推荐复合项目。底层模型利用社交数据(共同购买或浏览历史记录,照片的社交书签标记)来导出其他上下文来完成这些推荐任务。特别地,它着重于使推荐系统能够与用户交互以建议复合项目的技术,例如在线购物中的捆绑产品或度假旅行的行程计划。我们从用户(交互应该很容易,并且应该迅速收敛)以及系统(有效计算)的角度研究了实现有效推荐计算的技术和算法挑战。性能和用户研究结果,这些结果是使用众包平台Amazon Mechanical Turk进行的。最后,我们简要介绍该领域中其他有希望的问题以及未来的机会。

著录项

  • 作者

    Basu Roy, Senjuti.;

  • 作者单位

    The University of Texas at Arlington.;

  • 授予单位 The University of Texas at Arlington.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2011
  • 页码 255 p.
  • 总页数 255
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号