Answers.Body: <p>Not sure if you are bent on using DOC2VEC, but why not use OpenAI embeddings or any Hugging Face model, and store them as a sparse-dense vector in a vector database (NOTE - the concept of sparse-dense was designed by Pinecone) they have publicly made it transparent how to do it yourself).</p>
  <p>Using Sparse-dense makes sure your similarities are a blend of semantics as well as lexical which will work perfectly for your case.</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2023-07-02T06:17:33.790Z
Answers.LastActivityDate: 2023-07-02T06:17:33.790Z
Answers.UserDisplayName: Chinmay
Answers.Body: <p>You need to create an active learning loop over the process of the learning. Try to start from a history of tickets and using doc2vec to get the similarity. When you find a bad result in the result of your classifier, then report it and then try to retrain the classifier. Also, you can wait to retrain the model, up to finding the predefined batch0size of the new data which are not in the training set. </p>
  
  <p>Also, to get a better result in the active learning loop, you can testify incoming data by the measuring of the classifier uncertainty over it. If the entropy of the classifier over the data is not in a good situation, you can label the data by the operator (as an oracle) and then up reach to the predefined batch-size, retrain the classifier.</p>
  
  <p>Morevoer, to know better about the active learning process and query strategies follow <a href="https://en.wikipedia.org/wiki/Active_learning_(machine_learning)" rel="nofollow noreferrer">this link</a> (and other articles in that link like <a href="http://burrsettles.com/pub/settles.activelearning.pdf" rel="nofollow noreferrer">this article</a>).</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-09-16T20:32:43.260Z
Answers.LastActivityDate: 2019-09-16T20:39:01.170Z
Answers.LastEditDate: 2019-09-16T20:39:01.170Z
Answers.UserDisplayName: OmG
Body: <p>I'm dealing with a &quot;ticket similarity task&quot;.</p>
  <p>Every time new tickets arrive at the help desk (customer service), I need to compare them and find out about similar ones.</p>
  <p>In this way, once the operator responds to a ticket, at the same time he can solve the others similar to the one solved.</p>
  <p>I expect an input ticket and all the other tickets with their similarity in output.</p>
  <p>I thought about using <strong>DOC2VEC</strong>, but it requires training every time a new ticket enters.</p>
  <p>What do you recommend?</p>
  
Tags: <machine-learning><word-embedding><similarity>
Title: How could I compute in real-time the similarity between tickets?
UserDisplayName: Alfonso
ThreadText: # How could I compute in real-time the similarity between tickets?
  
  (Asked by: username_0 on 2019-09-16)
  
  I'm dealing with a "ticket similarity task".
  
  Every time new tickets arrive at the help desk (customer service), I need to compare them and find out about similar ones.
  
  In this way, once the operator responds to a ticket, at the same time he can solve the others similar to the one solved.
  
  I expect an input ticket and all the other tickets with their similarity in output.
  
  I thought about using **DOC2VEC**, but it requires training every time a new ticket enters.
  
  What do you recommend?
  
  **Tags:** machine-learning, word-embedding, similarity
  
  ---
  
  ## 2 answers
  
  ### Answer by username_1 on 2023-07-02. Score: 1
  
  Not sure if you are bent on using DOC2VEC, but why not use OpenAI embeddings or any Hugging Face model, and store them as a sparse-dense vector in a vector database (NOTE - the concept of sparse-dense was designed by Pinecone) they have publicly made it transparent how to do it yourself).
  
  Using Sparse-dense makes sure your similarities are a blend of semantics as well as lexical which will work perfectly for your case.
  
  
  ---
  
  ### Answer by username_2 on 2019-09-16. Score: 0
  
  You need to create an active learning loop over the process of the learning. Try to start from a history of tickets and using doc2vec to get the similarity. When you find a bad result in the result of your classifier, then report it and then try to retrain the classifier. Also, you can wait to retrain the model, up to finding the predefined batch0size of the new data which are not in the training set.
  
  Also, to get a better result in the active learning loop, you can testify incoming data by the measuring of the classifier uncertainty over it. If the entropy of the classifier over the data is not in a good situation, you can label the data by the operator (as an oracle) and then up reach to the predefined batch-size, retrain the classifier.
  
  Morevoer, to know better about the active learning process and query strategies follow [this link](https://en.wikipedia.org/wiki/Active_learning_(machine_learning)) (and other articles in that link like [this article](http://burrsettles.com/pub/settles.activelearning.pdf)).
  
  
  ---
  
  