WO2017143920A1 - 一种区分主题的方法及装置 - Google Patents

一种区分主题的方法及装置 Download PDF

Info

Publication number
WO2017143920A1
WO2017143920A1 PCT/CN2017/073445 CN2017073445W WO2017143920A1 WO 2017143920 A1 WO2017143920 A1 WO 2017143920A1 CN 2017073445 W CN2017073445 W CN 2017073445W WO 2017143920 A1 WO2017143920 A1 WO 2017143920A1
Authority
WO
WIPO (PCT)
Prior art keywords
topic
data
clustering
topics
distinguishing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2017/073445
Other languages
English (en)
French (fr)
Inventor
蔡宁
张凯
杨旭
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alibaba Group Holding Ltd
Original Assignee
Alibaba Group Holding Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Alibaba Group Holding Ltd filed Critical Alibaba Group Holding Ltd
Priority to JP2018543228A priority Critical patent/JP2019510301A/ja
Publication of WO2017143920A1 publication Critical patent/WO2017143920A1/zh
Priority to US16/112,623 priority patent/US20180366106A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/36Creation of semantic tools, e.g. ontology or thesauri
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/35Clustering; Classification
    • G06F16/353Clustering; Classification into predefined classes
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/35Clustering; Classification
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/21Design or setup of recognition systems or techniques; Extraction of features in feature space; Blind source separation
    • G06F18/214Generating training patterns; Bootstrap methods, e.g. bagging or boosting
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/23Clustering techniques
    • G06F18/232Non-hierarchical techniques
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/20Natural language analysis
    • G06F40/205Parsing
    • G06F40/216Parsing using statistical methods
    • GPHYSICS
    • G10MUSICAL INSTRUMENTS; ACOUSTICS
    • G10LSPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
    • G10L15/00Speech recognition
    • G10L15/02Feature extraction for speech recognition; Selection of recognition unit
    • GPHYSICS
    • G10MUSICAL INSTRUMENTS; ACOUSTICS
    • G10LSPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
    • G10L15/00Speech recognition
    • G10L15/06Creation of reference templates; Training of speech recognition systems, e.g. adaptation to the characteristics of the speaker's voice
    • G10L15/063Training

Definitions

  • the present invention belongs to the field of data processing technologies, and in particular, to a method and apparatus for distinguishing topics.
  • the LDA (Latent Dirichlet Allocation) method is a document topic generation model, which is very suitable for obtaining problems from a large number of dialogues.
  • Each document represents a probability distribution formed by some topics, and each topic represents many words.
  • Each document in the corpus corresponds to a multinomial distribution of T (predetermined by trial and error, etc.), and the multinomial distribution is denoted as ⁇ .
  • Each subject corresponds to a multinomial distribution of V words in the vocabulary, and this multinomial distribution is denoted as ⁇ .
  • the above vocabulary is composed of all the different words in all the documents in the corpus, but in the actual modeling, some stop words (stopword) should be eliminated, and some stemming processing should be performed.
  • ⁇ and ⁇ have a Dirichlet prior distribution with hyperparameters ⁇ and ⁇ , respectively.
  • a topic z is extracted from the multi-distribution ⁇ corresponding to the document, and then a word w is extracted from the multi-distribution ⁇ corresponding to the topic z.
  • Nd is the total number of words in document d.
  • the LDA method is an unsupervised machine learning technique. LDA can be used to identify hidden topic information in a large-scale document collection or corpus, and to discover problems through clustering. But the LDA method itself cannot distinguish between new ones and old ones, and people's understanding of the problem and the understanding of the machine are poor. Different, some old problems may be broken up into new ones, and the clustering problems are not necessarily the ones you want.
  • An object of the present invention is to provide a method and apparatus for distinguishing topics, so as to solve the technical problem that the current technology cannot distinguish whether the clustered topic is a new topic or an old topic, or the clustered topic is not necessarily the desired topic. .
  • a method for distinguishing topics for identifying whether a data to be trained belongs to a known topic or a new topic, and the method for distinguishing topics includes:
  • the topics that are clustered based on the annotated data are known topics or new topics.
  • the training data set is clustered, and the clustering method used is an LDA clustering method.
  • the number of topics clustered by the LDA clustering method is greater than the number of known topics.
  • the data is extracted from the data corresponding to the known topic for labeling, and the labeled data and the data to be trained are combined into a training data set, and the labeled data is less than the data to be trained.
  • the distinguishing whether the subject obtained by the clustering according to the annotated data is a known topic or a new topic includes:
  • the topic is a new topic.
  • clustering the training data set, and clustering the subject to which the training data belongs further includes:
  • the probability of each keyword corresponding to each topic is clustered.
  • the distinguishing whether the subject obtained by the clustering according to the annotated data is a known topic or a new topic further includes:
  • the present invention also provides a device for distinguishing topics for identifying whether the data to be trained belongs to a known topic or a new topic, and the device for distinguishing topics includes:
  • a data extraction module configured to extract data from data corresponding to a known topic for labeling, and combine the labeled data with the data to be trained into a training data set;
  • a clustering module configured to cluster the training data set, and cluster the subject to which the training data belongs
  • the topic distinguishing module is configured to distinguish, according to the annotated data, whether the topic obtained by the cluster is a known topic or a new topic.
  • the clustering module clusters the training data set, and the clustering method used is an LDA clustering method.
  • the number of topics clustered by the LDA clustering method is greater than the number of known topics.
  • the data extraction module extracts data from the data corresponding to the known topic for labeling, and merges the labeled data with the data to be trained into a training data set, and the labeled data is less than the data to be trained.
  • the topic distinguishing module distinguishes whether the topic obtained by the clustering is a known topic or a new topic according to the labeled data, and performs the following operations:
  • the topic is a new topic.
  • the clustering module clusters the training data set, and the clustering obtains the subject to which the training data belongs, and further includes:
  • the probability of each keyword corresponding to each topic is clustered.
  • the topic distinguishing module distinguishes whether the topic obtained by the clustering is a known topic or a new topic according to the labeled data, and performs the following steps:
  • the method and device for distinguishing topics proposed by the present invention use a semi-supervised method to distinguish whether the topic clustered by the LDA is a problem known to the customer service by using a small amount of labeled data, and reduce the understanding of the problem and the machine-to-problem problem. The difference in understanding can accurately distinguish the problems raised by customers.
  • FIG. 1 is a flow chart of a method for distinguishing topics according to the present invention
  • FIG. 2 is a schematic structural view of a device for distinguishing the subject matter of the present invention.
  • This example takes the customer consultation often encountered in the customer service process as an example.
  • the general customer service personnel need to judge the problem that the customer is consulting according to the dialogue with the customer. Further judging whether the problem the user is consulting is a new problem or an old one is also very important for the improvement and development of the product.
  • the dialogue between the client and the customer service personnel is used as the training data, and the problem that the client wants to consult is learned from a large number of conversations through LDA clustering, and the problem that the client wants to consult is the theme obtained by LDA clustering, and Further judge whether the question the client wants to consult is a new question or an old one.
  • the method for distinguishing topics in this embodiment includes the following steps:
  • Step S1 Extract data from data corresponding to the known topic for labeling, and merge the labeled data with the data to be trained into a training data set.
  • This embodiment summarizes some old problems based on historical experience data, and these old problems are taken as known topics.
  • the customer service staff will gain experience in the usual work, and get some known topics based on the conversation data with the customer. Select some data from the dialogue data corresponding to these known topics to mark, and mark a small amount of data for each known topic, generally 3-5 conversations.
  • the magnitude of the annotation data is much smaller than the data to be trained. It affects the clustering results of the training data.
  • the annotated data A, B, C, D and the data to be trained are combined into a new training data set for subsequent clustering.
  • Step S2 Clustering the training data set, and clustering the subject to which the training data belongs.
  • the method for clustering in this embodiment adopts an LDA clustering method, which is an unsupervised machine learning technique, and LDA can be used to identify hidden topic information in a document collection or a corpus. .
  • LDA clustering is simply clustering a bunch of documents (so unsupervised learning).
  • a topic is a type.
  • the number of topics to be aggregated is specified in advance.
  • the number of topics is generally based on
  • the experience specifies a value, and in this embodiment, 3 times the number of old problems can be used as the topic number.
  • the result of clustering is an overview rate. The following is illustrated by an example, assuming the following sets of sentences:
  • Sentences 1 and 2 100% belong to Topic A;
  • Sentences 3 and 4 100% belong to Topic B;
  • Sentence 5 60% belongs to Topic A, 40% belongs to Topic B;
  • Topic A 30% broccoli, 15% banana, 10% breakfast, 10% chew, ... (for any word, you can know that TopicA is related to the theme of a food);
  • Topic B 20% Chinchilla, 20% kitten, 20% cute, 15% hamster,... (For any word, you can know that TopicB is related to the theme of a cute animal.
  • sentence 5 can be seen as a clustering result of an obvious probability type.
  • sentence 5 is considered to belong to topicA.
  • Sentences 1 and 2 are exactly 100% deterministic results.
  • Topic A Take Topic A as an example, that is to say, all the words corresponding to Topic A, 30% of the words are broccoli.
  • each word in each document is mapped to a Topic.
  • the theme to which the training data belongs and the corresponding probability can be identified from the training data set by the LDA clustering method. For example: sentence 5: 60% belongs to Topic A and 40% belongs to Topic B. It is also possible to further cluster the probabilities corresponding to each keyword under each topic, so that the keywords can be used to determine whether the topic is a known problem or a new one.
  • the present invention is not limited to the clustering method used.
  • the LDA clustering method may be adopted, or the Kmeans clustering method may be adopted, preferably the LDA clustering method is adopted, and the LDA clustering method can determine the corresponding training data.
  • the theme, as well as the probability of each keyword in the theme, will help to further analyze and judge the topic.
  • Step S3 According to the labeled data, the clustered topic is a known topic or a new topic.
  • the clustered topic can be classified according to the labeled data to be a known topic or a new topic.
  • the topic with the annotated data may be a refinement of the same known topic, and further judgment is required to be a known topic or a new topic.
  • the specific judgment can be manually determined according to the keywords appearing in each theme, that is, the judgment is based on the subject to which the keyword belongs, and details are not described herein again.
  • topic1 is a known topic and the old problem cannot be opened.
  • topic1 and topic2 may be known as old topic problems, and then further determined by keywords.
  • topic3 is a new topic.
  • the subject obtained by distinguishing the cluster according to the labeled data is a known topic or a new topic, and may also be judged according to how much the tag data appears in the topic, and many occurrences are considered to be old problems.
  • the number can be set according to the actual situation, and does not necessarily require all the marked data to appear in the subject to be considered as a known topic.
  • the embodiment further provides a device for distinguishing topics, which is used to identify whether the data to be trained belongs to a known topic or a new topic, and the device for distinguishing topics includes:
  • a data extraction module configured to extract data from data corresponding to a known topic for labeling, and combine the labeled data with the data to be trained into a training data set;
  • a clustering module configured to cluster the training data set, and cluster the subject to which the training data belongs
  • the topic distinguishing module is configured to distinguish, according to the annotated data, whether the topic obtained by the cluster is a known topic or a new topic.
  • the clustering module clusters the training data set, and the clustering method used is an LDA clustering method.
  • the number of topics clustered by the LDA clustering method in this embodiment is greater than the number of known topics.
  • the data extraction module extracts data from data corresponding to the known topic for labeling, and merges the labeled data with the data to be trained into a training data set, and the labeled data is less than the data to be trained.
  • the topic distinguishing module distinguishes whether the subject obtained by the clustering is a known topic or a new one according to the labeled data. Topic, do the following:
  • the topic is a new topic.
  • the clustering module clusters the training data set, and the clustering obtains the subject to which the training data belongs, and further includes:
  • the probability of each keyword corresponding to each topic is clustered.
  • the subject distinguishing module of the embodiment distinguishes whether the topic obtained by the clustering is a known topic or a new topic according to the labeled data, and performs the following steps:

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Artificial Intelligence (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Evolutionary Computation (AREA)
  • Evolutionary Biology (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Computational Linguistics (AREA)
  • Databases & Information Systems (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Health & Medical Sciences (AREA)
  • Multimedia (AREA)
  • Acoustics & Sound (AREA)
  • Human Computer Interaction (AREA)
  • Probability & Statistics with Applications (AREA)
  • General Health & Medical Sciences (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

一种区分主题的方法及装置,用于识别待训练数据属于已知主题还是新主题,所述区分主题的方法从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集(S1);然后对训练数据集进行聚类,聚类得到训练数据所属的主题(S2);最后根据标注的数据来区分聚类得到的主题是已知主题还是新主题(S3)。所述装置包括数据抽取模块、聚类模块和主题区分模块。所述方法及装置减少了人对问题的理解和机器对问题理解的差异,能够准确地区分客户所提出的问题。

Description

一种区分主题的方法及装置
本申请要求2016年02月26日递交的申请号为201610107373.8、发明名称为“一种区分主题的方法及装置”的中国专利申请的优先权,其全部内容通过引用结合在本申请中。
技术领域
本发明属于数据处理技术领域,尤其涉及一种区分主题的方法及装置。
背景技术
用户在使用产品或者服务的时候经常会遇到自己无法处理的问题,或者需要咨询的问题,进而会寻求客服帮助。每天用户的咨询量非常大,咨询的角度也不同,很多用户都在问相同的问题,有些是客服已经知道的老问题,有一些是没有被发现的新问题。
了解用户提出的问题,可以对产品的设计和改进提供帮助。例如如果发现新问题,有可能是产品需要改进的点。如果老问题的咨询量变多或者变少,则可能是某个功能块用户数减少,也是需要引起注意的。因此,如何从大规模的对话中找出问题,并且能区分出新问题和老问题,是非常必要的并且重要的。
LDA(Latent Dirichlet Allocation)方法是一种文档主题生成模型,非常适合从大量的对话中获取问题,每一篇文档代表了一些主题所构成的一个概率分布,而每一个主题又代表了很多单词所构成的一个概率分布。语料库中的每一篇文档与T(通过反复试验等方法事先给定)个主题的一个多项分布相对应,将该多项分布记为θ。每个主题又与词汇表(vocabulary)中的V个单词的一个多项分布相对应,将这个多项分布记为φ。上述词汇表是由语料库中所有文档中的所有互异单词组成,但实际建模的时候要剔除一些停用词(stopword),还要进行一些词干化(stemming)处理等。θ和φ分别有一个带有超参数(hyperparameter)α和β的Dirichlet先验分布。对于一篇文档d中的每一个单词,从该文档所对应的多项分布θ中抽取一个主题z,然后再从主题z所对应的多项分布φ中抽取一个单词w。将这个过程重复Nd次,就产生了文档d,这里的Nd是文档d的单词总数。
LDA方法是一种非监督机器学习技术,LDA可以用来识别大规模文档集(document collection)或语料库(corpus)中潜藏的主题信息,通过聚类发现问题。但是LDA方法本身不能区分哪些是新问题哪些是老问题,而且人对问题的理解和机器的理解存在差 异,有些老问题可能被打散变成新问题,聚类出来的问题并不一定是想要的问题。
发明内容
本发明的目的是提供一种区分主题的方法及装置,以解决现在技术无法区分聚类得到的主题是新主题还是老主题,或者聚类得到的主题并不一定是想要的主题等技术问题。
为了实现上述目的,本发明技术方案如下:
一种区分主题的方法,用于识别待训练数据属于已知主题还是新主题,所述区分主题的方法包括:
从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集;
对训练数据集进行聚类,聚类得到训练数据所属的主题;
根据标注的数据来区分聚类得到的主题是已知主题还是新主题。
进一步地,所述对训练数据集进行聚类,所采用的聚类方法为LDA聚类方法。
进一步地,所述LDA聚类方法聚类的主题数目大于已知主题的数目。
进一步地,所述从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集,所标注的标注数据少于待训练数据。
进一步地,所述根据标注的数据来区分聚类得到的主题是已知主题还是新主题,包括:
如果一个已知主题的所有标注数据只出现在一个主题中,那么这个主题是已知主题;
如果一个主题中没有出现已知主题的标注数据,则该主题是新主题。
进一步地,所述对训练数据集进行聚类,聚类得到训练数据所属的主题,还包括:
聚类出对应到每个主题下每一个关键词的概率。
进一步地,所述根据标注的数据来区分聚类得到的主题是已知主题还是新主题,还包括:
根据每个聚类得到的主题对应的关键词,进一步判断聚类得到的主题是已知主题还是新主题。
本发明还提出了一种区分主题的装置,用于识别待训练数据属于已知主题还是新主题,所述区分主题的装置包括:
数据抽取模块,用于从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集;
聚类模块,用于对训练数据集进行聚类,聚类得到训练数据所属的主题;
主题区分模块,用于根据标注的数据来区分聚类得到的主题是已知主题还是新主题。
优选地,所述聚类模块对训练数据集进行聚类,所采用的聚类方法为LDA聚类方法。
进一步地,所述LDA聚类方法聚类的主题数目大于已知主题的数目。
进一步地,所述数据抽取模块从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集,所标注的标注数据少于待训练数据。
进一步地,所述主题区分模块根据标注的数据来区分聚类得到的主题是已知主题还是新主题,执行如下操作:
如果一个已知主题的所有标注数据只出现在一个主题中,那么这个主题是已知主题;
如果一个主题中没有出现已知主题的标注数据,则该主题是新主题。
进一步地,所述聚类模块对训练数据集进行聚类,聚类得到训练数据所属的主题,还包括:
聚类出对应到每个主题下每一个关键词的概率。
进一步地,所述主题区分模块根据标注的数据来区分聚类得到的主题是已知主题还是新主题,还执行如下步骤:
根据每个聚类得到的主题对应的关键词,进一步判断聚类得到的主题是已知主题还是新主题。
本发明提出的一种区分主题的方法及装置,使用半监督的方法,利用少量标注的数据区分LDA聚类出来的主题是否是客服已知的问题,并且减少人对问题的理解和机器对问题理解的差异,能够准确地区分客户所提出的问题。
附图说明
图1为本发明区分主题的方法流程图;
图2为本发明区分主题的装置结构示意图。
具体实施方式
下面结合附图和实施例对本发明技术方案做进一步详细说明,以下实施例不构成对本发明的限定。
本实施例以客户服务过程中经常遇到的客户咨询为例,一般客服人员需要根据与客户的对话,来判别客户所咨询的问题是什么。而进一步判断用户所咨询的问题属于新问题还是老问题,对产品的改进和发展也是非常重要的。在本实施例中,将客户与客服人员之间的对话作为训练数据,通过LDA聚类从大量的对话中获知客户所要咨询的问题,客户所要咨询的问题即通过LDA聚类得到的主题,并进一步判断客户所要咨询的问题是新问题还是老问题。
如图1所示,本实施例一种区分主题的方法,包括如下步骤:
步骤S1、从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集。
本实施例根据历史经验数据总结出一些老问题,将这些老问题作为已知主题。客服人员在平时的工作中会积累经验,根据接听到的与客户的对话数据,得到一些已知主题。从这些已知主题对应的对话数据中选取部分数据进行标注,对每个已知主题标注少量数据,一般为3-5条对话数,标注数据的量级比待训练数据要小很多,不会对训练数据的聚类结果造成影响。
例如:
A.我的资格够了,为什么开通不了。标注:开通不了。
B.我已经实名认证了,怎么还开通不了啊。标注:开通不了。
C.我朋友都开通了,为什么开通不了。标注:开通不了。
D.为什么开通不了啊。标注:开通不了。
将标注的数据A、B、C、D与待训练数据合并成新的训练数据集,用于进行后续的聚类。
步骤S2、对训练数据集进行聚类,聚类得到训练数据所属的主题。
本实施例进行聚类的方法采用LDA聚类方法,LDA聚类方法是一种非监督机器学习技术,LDA可以用来识别大规模文档集(document collection)或语料库(corpus)中潜藏的主题信息。
LDA聚类简单来说就是为一堆文档进行聚类(所以是非监督学习),一种主题(topic)就是一类,要聚成的主题(topic)数目是事先指定的,topic数目一般是根据经验指定一个值,在本实施例中可以用老问题数目的3倍作为topic数目。聚类的结果是一个概 率。以下通过一个例子进行说明,假设有以下几组句子:
1、我喜欢吃西兰花和香蕉;
2、我吃了有香蕉和菠菜汁的早餐;
3、龙猫和小猫很可爱;
4、我妹妹昨天收养了一只小猫;
5、看看这个可爱的仓鼠嚼一块西兰花。
如果对这些句子进行LDA聚类,聚类的topic有两个,分别是TopicA和TopicB,那么经过LDA聚类后得到:
句子1和2:100%属于Topic A;
句子3和4:100%属于Topic B;
句子5:60%属于Topic A,40%属于Topic B;
Topic A:30%西兰花,15%香蕉,10%早餐,10%咀嚼,…(对于任何一个单词,可以得知TopicA都关系到一个食物的主题);
Topic B:20%龙猫,20%小猫,20%可爱,15%仓鼠,…(对于任何一个单词,可以得知TopicB都关系到一个可爱的动物的主题。
上面关于句子5的结果,可以看出来是一个明显的概率类型的聚类结果,在本实施例中会认为句子5属于topicA。句子1和2正好都是100%的确定性结果。
再看例子里的结果,除了为每句话得出了一个概率的聚类结果,而且对每个Topic,都有代表性的词以及一个比例。以Topic A为例,就是说所有对应到Topic A的词里面,有30%的词是西兰花。在LDA算法中,会把每一个文档中的每一个词对应到一个Topic。
本实施例通过LDA聚类方法可以从训练数据集中识别出训练数据所属的主题,以及对应的概率。例如:句子5:60%属于Topic A,40%属于Topic B。还可以进一步聚类出对应到每个主题下每一个关键词的概率,从而可以通过这些关键词来判断主题是已知问题还是新问题。
需要说明的是,本发明不限于所采用的聚类方法,例如可以采用LDA聚类方法,也可以采用Kmeans聚类方法,优选地采用LDA聚类方法,LDA聚类方法能够确定训练数据对应的主题,以及主题中各个关键词的概率,有利于进一步对主题进行分析判断。
步骤S3、根据标注的数据来区分聚类得到的主题是已知主题还是新的主题。
在通过LDA聚类方法识别出训练数据所属的主题后,可以根据标注的数据来区分聚类得到的主题是已知主题还是新主题。
具体判断方法包括:
1)、如果一个已知主题的所有标注数据只出现在一个主题中,那么这个主题就是个已知主题;
2)、如果一个主题中没有出现已知主题的标注数据,则该主题就是新主题;
3)、如果一个已知主题的标注数据出现在不同的主题里,则出现有标注数据的主题有可能是同一个已知主题的细化,需要进一步进行判断是已知主题还是新主题。具体的判断可以根据每个主题中出现的关键词来人工判断,即根据关键词所属的主题来进行判断,这里不再赘述。
例如:
如果标注的句子A、B、C、D都属于topic1,那么就认为topic1是已知主题老问题开通不了。
如果A、B属于topic1,C、D属于topic2,那么就认为topic1,topic2都可能是已知主题老问题开通不了,再通过关键词进一步确定。
如果topic3中都没有出现A、B、C、D,则topic3是新主题。
需要说明的是,在根据标注的数据来区分聚类得到的主题是已知主题还是新主题,也可以根据标注数据在主题中出现的多少来进行判断,出现的多则认为是老问题,出现的多少可以根据实际情况来设定,并不一定要求所有标注的数据都出现在主题中才认定为是已知主题。
如图2所示,本实施例还提出了一种区分主题的装置,用于识别待训练数据属于已知主题还是新主题,该区分主题的装置包括:
数据抽取模块,用于从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集;
聚类模块,用于对训练数据集进行聚类,聚类得到训练数据所属的主题;
主题区分模块,用于根据标注的数据来区分聚类得到的主题是已知主题还是新主题。
优选地,聚类模块对训练数据集进行聚类,所采用的聚类方法为LDA聚类方法。
本实施例LDA聚类方法聚类的主题数目大于已知主题的数目。
本实施例数据抽取模块从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集,所标注的标注数据少于待训练数据。
本实施例主题区分模块根据标注的数据来区分聚类得到的主题是已知主题还是新 主题,执行如下操作:
如果一个已知主题的所有标注数据只出现在一个主题中,那么这个主题是已知主题;
如果一个主题中没有出现已知主题的标注数据,则该主题是新主题。
本实施例聚类模块对训练数据集进行聚类,聚类得到训练数据所属的主题,还包括:
聚类出对应到每个主题下每一个关键词的概率。
显然,本实施例主题区分模块根据标注的数据来区分聚类得到的主题是已知主题还是新主题,还执行如下步骤:
根据每个聚类得到的主题对应的关键词,进一步判断聚类得到的主题是已知主题还是新主题。
以上实施例仅用以说明本发明的技术方案而非对其进行限制,在不背离本发明精神及其实质的情况下,熟悉本领域的技术人员当可根据本发明作出各种相应的改变和变形,但这些相应的改变和变形都应属于本发明所附的权利要求的保护范围。

Claims (14)

  1. 一种区分主题的方法,用于识别待训练数据属于已知主题还是新主题,其特征在于,所述区分主题的方法包括:
    从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集;
    对训练数据集进行聚类,聚类得到训练数据所属的主题;
    根据标注的数据来区分聚类得到的主题是已知主题还是新主题。
  2. 根据权利要求1所述的区分主题的方法,其特征在于,所述对训练数据集进行聚类,所采用的聚类方法为LDA聚类方法。
  3. 根据权利要求2所述的区分主题的方法,其特征在于,所述LDA聚类方法聚类的主题数目大于已知主题的数目。
  4. 根据权利要求1所述的区分主题的方法,其特征在于,所述从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集,所标注的标注数据少于待训练数据。
  5. 根据权利要求1所述的区分主题的方法,其特征在于,所述根据标注的数据来区分聚类得到的主题是已知主题还是新主题,包括:
    如果一个已知主题的所有标注数据只出现在一个主题中,那么这个主题是已知主题;
    如果一个主题中没有出现已知主题的标注数据,则该主题是新主题。
  6. 根据权利要求5所述的区分主题的方法,其特征在于,所述对训练数据集进行聚类,聚类得到训练数据所属的主题,还包括:
    聚类出对应到每个主题下每一个关键词的概率。
  7. 根据权利要求6所述的区分主题的方法,其特征在于,所述根据标注的数据来区分聚类得到的主题是已知主题还是新主题,还包括:
    根据每个聚类得到的主题对应的关键词,进一步判断聚类得到的主题是已知主题还是新主题。
  8. 一种区分主题的装置,用于识别待训练数据属于已知主题还是新主题,其特征在于,所述区分主题的装置包括:
    数据抽取模块,用于从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集;
    聚类模块,用于对训练数据集进行聚类,聚类得到训练数据所属的主题;
    主题区分模块,用于根据标注的数据来区分聚类得到的主题是已知主题还是新主题。
  9. 根据权利要求8所述的区分主题的装置,其特征在于,所述聚类模块对训练数据集进行聚类,所采用的聚类方法为LDA聚类方法。
  10. 根据权利要求9所述的区分主题的装置,其特征在于,所述LDA聚类方法聚类的主题数目大于已知主题的数目。
  11. 根据权利要求8所述的区分主题的装置,其特征在于,所述数据抽取模块从已知主题对应的数据中抽取数据进行标注,将标注的数据与待训练数据合并成训练数据集,所标注的标注数据少于待训练数据。
  12. 根据权利要求8所述的区分主题的装置,其特征在于,所述主题区分模块根据标注的数据来区分聚类得到的主题是已知主题还是新主题,执行如下操作:
    如果一个已知主题的所有标注数据只出现在一个主题中,那么这个主题是已知主题;
    如果一个主题中没有出现已知主题的标注数据,则该主题是新主题。
  13. 根据权利要求12所述的区分主题的装置,其特征在于,所述聚类模块对训练数据集进行聚类,聚类得到训练数据所属的主题,还包括:
    聚类出对应到每个主题下每一个关键词的概率。
  14. 根据权利要求13所述的区分主题的装置,其特征在于,所述主题区分模块根据标注的数据来区分聚类得到的主题是已知主题还是新主题,还执行如下步骤:
    根据每个聚类得到的主题对应的关键词,进一步判断聚类得到的主题是已知主题还是新主题。
PCT/CN2017/073445 2016-02-26 2017-02-14 一种区分主题的方法及装置 Ceased WO2017143920A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2018543228A JP2019510301A (ja) 2016-02-26 2017-02-14 トピックを区別するための方法及び機器
US16/112,623 US20180366106A1 (en) 2016-02-26 2018-08-24 Methods and apparatuses for distinguishing topics

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610107373.8 2016-02-26
CN201610107373.8A CN107133226B (zh) 2016-02-26 2016-02-26 一种区分主题的方法及装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/112,623 Continuation US20180366106A1 (en) 2016-02-26 2018-08-24 Methods and apparatuses for distinguishing topics

Publications (1)

Publication Number Publication Date
WO2017143920A1 true WO2017143920A1 (zh) 2017-08-31

Family

ID=59684972

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/073445 Ceased WO2017143920A1 (zh) 2016-02-26 2017-02-14 一种区分主题的方法及装置

Country Status (5)

Country Link
US (1) US20180366106A1 (zh)
JP (1) JP2019510301A (zh)
CN (1) CN107133226B (zh)
TW (1) TW201734759A (zh)
WO (1) WO2017143920A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10861022B2 (en) * 2019-03-25 2020-12-08 Fmr Llc Computer systems and methods to discover questions and answers from conversations
FR3094508A1 (fr) * 2019-03-29 2020-10-02 Orange Système et procédé d’enrichissement de données
TWI807400B (zh) * 2021-08-27 2023-07-01 台達電子工業股份有限公司 產生實體關係抽取模型的裝置及方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110252015A1 (en) * 2007-07-02 2011-10-13 Kristina Butvydas Bard Qualitative Search Engine Based On Factors Of Consumer Trust Specification
CN102902700A (zh) * 2012-04-05 2013-01-30 中国人民解放军国防科学技术大学 基于在线增量演化主题模型的软件自动分类方法
CN103559175A (zh) * 2013-10-12 2014-02-05 华南理工大学 一种基于聚类的垃圾邮件过滤系统及方法
CN104054072A (zh) * 2011-12-13 2014-09-17 国际商业机器公司 在社交网络中的事件挖掘

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100153318A1 (en) * 2008-11-19 2010-06-17 Massachusetts Institute Of Technology Methods and systems for automatically summarizing semantic properties from documents with freeform textual annotations
US8176067B1 (en) * 2010-02-24 2012-05-08 A9.Com, Inc. Fixed phrase detection for search
CN101916376B (zh) * 2010-07-06 2012-08-29 浙江大学 基于局部样条嵌入的正交半监督子空间图像分类方法
JP5691289B2 (ja) * 2010-08-11 2015-04-01 ソニー株式会社 情報処理装置、情報処理方法、及び、プログラム
JP2012038239A (ja) * 2010-08-11 2012-02-23 Sony Corp 情報処理装置、情報処理方法、及び、プログラム
EP2546760A1 (en) * 2011-07-11 2013-01-16 Accenture Global Services Limited Provision of user input in systems for jointly discovering topics and sentiment
CN103177024A (zh) * 2011-12-23 2013-06-26 微梦创科网络科技(中国)有限公司 一种话题信息展现方法和装置
JP2015004996A (ja) * 2012-02-14 2015-01-08 インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation 複数の文書をクラスタリングする装置
US10599697B2 (en) * 2013-03-15 2020-03-24 Uda, Llc Automatic topic discovery in streams of unstructured data
US10204026B2 (en) * 2013-03-15 2019-02-12 Uda, Llc Realtime data stream cluster summarization and labeling system
US9317809B1 (en) * 2013-09-25 2016-04-19 Emc Corporation Highly scalable memory-efficient parallel LDA in a shared-nothing MPP database
US9177262B2 (en) * 2013-12-02 2015-11-03 Qbase, LLC Method of automated discovery of new topics
US20160110428A1 (en) * 2014-10-20 2016-04-21 Multi Scale Solutions Inc. Method and system for finding labeled information and connecting concepts
CN104463633A (zh) * 2014-12-19 2015-03-25 成都品果科技有限公司 一种基于地理位置和兴趣点信息的用户细分方法
US9722957B2 (en) * 2015-05-04 2017-08-01 Conduent Business Services, Llc Method and system for assisting contact center agents in composing electronic mail replies
US10482119B2 (en) * 2015-09-14 2019-11-19 Conduent Business Services, Llc System and method for classification of microblog posts based on identification of topics
US10409823B2 (en) * 2015-12-29 2019-09-10 Facebook, Inc. Identifying content for users on online social networks
US10789546B2 (en) * 2016-06-23 2020-09-29 International Business Machines Corporation Cognitive machine learning classifier generation
US10635703B2 (en) * 2017-10-19 2020-04-28 International Business Machines Corporation Data clustering
US10970595B2 (en) * 2018-06-20 2021-04-06 Netapp, Inc. Methods and systems for document classification using machine learning

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110252015A1 (en) * 2007-07-02 2011-10-13 Kristina Butvydas Bard Qualitative Search Engine Based On Factors Of Consumer Trust Specification
CN104054072A (zh) * 2011-12-13 2014-09-17 国际商业机器公司 在社交网络中的事件挖掘
CN102902700A (zh) * 2012-04-05 2013-01-30 中国人民解放军国防科学技术大学 基于在线增量演化主题模型的软件自动分类方法
CN103559175A (zh) * 2013-10-12 2014-02-05 华南理工大学 一种基于聚类的垃圾邮件过滤系统及方法

Also Published As

Publication number Publication date
CN107133226A (zh) 2017-09-05
JP2019510301A (ja) 2019-04-11
CN107133226B (zh) 2021-12-07
US20180366106A1 (en) 2018-12-20
TW201734759A (zh) 2017-10-01

Similar Documents

Publication Publication Date Title
Oya et al. A template-based abstractive meeting summarization: Leveraging summary and source text relationships
CN108604228B (zh) 用于多层单词表示的语言特征生成的系统和方法
Mirheidari et al. Detecting Signs of Dementia Using Word Vector Representations.
CN105069021B (zh) 基于领域的中文短文本情感分类方法
Zhai et al. Discovering latent structure in task-oriented dialogues
CN108446813A (zh) 一种电商服务质量综合评价的方法
Bhattasali et al. Automatic identification of rhetorical questions
CN111177350A (zh) 智能语音机器人的话术形成方法、装置和系统
CN107038154A (zh) 一种文本情感识别方法和装置
US20190236613A1 (en) Semi-supervised, deep-learning approach for removing irrelevant sentences from text in a customer-support system
Safrin et al. Sentiment analysis on online product review
CN111309903A (zh) 一种数据处理方法、装置、存储介质和电子设备
Srivastava et al. Challenges with sentiment analysis of on-line micro-texts
CN107766560B (zh) 客服服务流程的评价方法和系统
Najadat et al. Multimodal sentiment analysis of Arabic videos
Prabhakaran et al. Detecting institutional dialog acts in police traffic stops
Yordanova et al. Automatic detection of everyday social behaviours and environments from verbatim transcripts of daily conversations
WO2017143920A1 (zh) 一种区分主题的方法及装置
Vandeghinste et al. Fullstop: Punctuation and segmentation prediction for dutch with transformers
Purver et al. Detecting action items in multi-party meetings: Annotation and initial experiments
Bui et al. Extracting decisions from multi-party dialogue using directed graphical models and semantic similarity
US20240078559A1 (en) System and method for suggesting and generating a customer service template
Muischnek et al. Latvian tweet corpus and investigation of sentiment analysis for Latvian
CN109033078B (zh) 语句类别识别方法及装置、存储介质、处理器
Ijaz et al. Biasness identification of talk show's host by using twitter data

Legal Events

Date Code Title Description
ENP Entry into the national phase

Ref document number: 2018543228

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17755749

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 17755749

Country of ref document: EP

Kind code of ref document: A1