In this paper, we develop an interactive hierarchical topic search system. In our system, the generation of topic names is mainly based on the N-gram statistical language model. The construction of hierarchical tree relationships between topics is mainly based on the concept of mathematical sets. In this study, the concept of mathematical sets not only helps the system to construct a topic hierarchy tree quickly, but also allows different users to use different binary operations to generate different interactive search results. In general, this study has the following three advantages. First, the generated topic names are presented in a hierarchical form rather than a flat form. Secondly, the interactive search for this study was achieved by non-stored user search and click history. Therefore, our approach can avoid personal privacy and large storage space issues. Finally, the concept of mathematical sets not only allows us to generate topic trees in linear time, but also allows users to run all possible binary operations to meet various interactive search needs.

在本文中，我们开发了一个交互式的分层主题搜索系统。在我们的系统中，主题名称的生成主要基于N-gram统计语言模型。主题之间的层次树关系的构建主要基于数学集的概念。在这项研究中，数学集的概念不仅有助于系统快速构建主题层次树，而且还允许不同的用户使用不同的二进制运算来生成不同的交互式搜索结果。总的来说，这项研究具有以下三个优点。首先，生成的主题名称以分层形式而非平面形式呈现。其次，该研究的交互式搜索是通过非存储的用户搜索和点击历史记录来实现的。因此，我们的方法可以避免个人隐私和大存储空间问题。最后，数学集的概念不仅使我们能够在线性时间内生成主题树，而且还允许用户运行所有可能的二进制运算来满足各种交互式搜索需求。