Advanced Search
MyIDEAS: Login

Machine Learning-Based Search for Similar Unstructured Text Entries Using Only a Few Positive Samples with Ranking by Similarity

Contents:

Author Info

  • Jan Zizka

    ()
    (Department of Informatics, Faculty of Business and Economics, Mendel University in Brno)

  • Frantisek Darena

    ()
    (Department of Informatics, Faculty of Business and Economics, Mendel University in Brno)

  • Arnost Svoboda

    ()
    (Department of Applied Mathematics and Computer Science, Faculty of Economics and Administration, Masaryk University)

Abstract

This research was inspired by the procedures that are used by human bibliographic searchers: Given some textual, only 'positive' (interesting) examples, coming from one category find the most similar ones that belong to a relevant topic. The problem of categorization of unlabeled relevant and irrelevant textual documents is here solved by using a small subset of relevant available patterns labeled manually. Unlabeled text items are compared with such labeled patterns. The unlabeled samples are then ranked according their degree of similarity with the patterns. At the top of the rank, there are the most similar (relevant) items. Entries receding from the rank top represent less and less similar entries. This simple method, aimed at processing large volumes of text entries, provides practically acceptable filtering results from the accuracy point of view and users can avoid the demanding task of labeling too many training examples to be able to apply a chosen classifier. The ranking-based approach provides results that can be further used for the following text-item processing where the number of irrelevant items is already not so high as it is usually typical for, for example, only the raw browsing results provided by Internet search engines. Even if this relatively simple automatic search is not errorless, it can help process particularly very large textual unstructured data volumes. Such an approach can help also in the economics area, for example, to automatically categorize written opinions of customers (as amazon.com is collecting via the Internet), process network-based discussion groups, and so like.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: ftp://ftp.mendelu.cz/RePEc/men/wpaper/03_2010.pdf
File Function: Full text
Download Restriction: no

Bibliographic Info

Paper provided by Mendel University in Brno, Faculty of Business and Economics in its series MENDELU Working Papers in Business and Economics with number 2010-03.

as in new window
Length: 19
Date of creation: Mar 2011
Date of revision:
Handle: RePEc:men:wpaper:03_2010

Contact details of provider:
Postal: Zemědělská 1, Brno
Phone: +420-5-45131111
Fax: +420-5-45212287
Email:
Web page: http://vyzc.pef.mendelu.cz/en
More information through EDIRC

Related research

Keywords: unlabeled text documents; one-class categorization; text similarity; ranking by similarity; pattern recognition; machine learning; natural language processing;

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:men:wpaper:03_2010. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Luděk Kouba).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.