Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Experimental Setup
Experimental Results of the Wer Framework
Dataset
Related Work
Conclusions and Future Work
References
All Topics
Computer Science
Information Systems

A generic Web-based entity resolution framework

Profile image of Denilson A PereiraDenilson A Pereira

2011, Journal of the American Society for Information Science and Technology

https://doi.org/10.1002/ASI.21518
visibility

…

description

14 pages

link

1 file

Abstract

Web data repositories usually contain references to thousands of real-world entities from multiple sources. It is not uncommon that multiple entities share the same label (polysemes) and that distinct label variations are associated with the same entity (synonyms), which frequently leads to ambiguous interpretations. Further, spelling variants, acronyms, abbreviated forms, and misspellings compound to worsen the problem. Solving this problem requires identifying which labels correspond to the same real-world entity, a process known as entity resolution. One approach to solve the entity resolution problem is to associate an authority identifier and a list of variant forms with each entity-a data structure known as an authority file. In this work, we propose a generic framework for implementing a method for generating authority files. Our method uses information from the Web to improve the quality of the authority file and, because of that, is referred to as WER-Web-based Entity Resolution. Our contribution here is threefold: (a) we discuss how to implement the WER framework, which is flexible and easy to adapt to new domains; (b) we run extended experimentation with our WER framework to show that it outperforms selected baselines; and (c) we compare the results of a specialized solution for author name resolution with those produced by the generic WER framework, and show that the WER results remain competitive.

Related papers

Entity Resolution: Past, Present and Yet-to-Come
Ekaterini Ioannou

2020

Entity Resolution (ER) lies at the core of data integration, with a bulk of research focusing on its effectiveness and its time efficiency. Most past relevant works were crafted for addressing Veracity over structured (relational) data. They typically rely on schema, expert and external knowledge to maximize accuracy. Part of these methods have been recently extended to process large volumes of data through massive parallelization techniques, such as the MapReduce paradigm. With the present advent of Big Web Data, the scope moved towards Variety, aiming to handle semi-structured data collections, with noisy and highly heterogeneous information. Relevant works adopt a novel, loosely schema-aware functionality that emphasizes scalability and robustness to noise. Another line of present research focuses on Velocity, i.e., processing data collections of a continuously increasing volume. In this tutorial, we present the ER generations by discussing past, present, and yet-to-come mechanis...

View PDFchevron_right
JedAI: The Force Behind Entity Resolution
George Giannakopoulos

Lecture Notes in Computer Science, 2017

We present JedAI, a toolkit for Entity Resolution that can be used in three different ways: as an open-source Java library that implements numerous state-of-the-art, domain-independent methods, as a workbench that facilitates the evaluation of their relative performance and as a desktop application that offers out-of-the-box ER solutions. JedAI bridges the gap between the database and the Semantic Web communities, offering solutions that are applicable to both relational and RDF data. It also conveys a modular architecture that facilitates its extension with more methods and with more comprehensive workflows.

View PDFchevron_right
ANEAR: Automatic Named Entity Aliasing Resolution
Ayah Zirikly

Identifying the different aliases used by or for an entity is emerging as a significant problem in reliable Information Extraction systems, especially with the proliferation of social media and their ever growing impact on differ- ent aspects of modern life such as politics, finance, security, etc. In this paper, we address the novel problem of Named Entity Aliasing Resolution (NEAR). We attempt to solve the NEAR problem in a language-independent setting by extracting the different aliases and variants of person named entities. We gen- erate feature vectors for the named entities by building co-occurrence models that use different weighting schemes. The aliasing resolution process applies un- supervised machine learning techniques over the vector space models in order to produce groups of entities along with their aliases. We test our approach on two languages: Arabic and English. We study the impact of varying the level of morphological preprocessing of the words, as well as the part of speech tags sur- rounding the person named entities, and the named entities’ distribution in the data set. We create novel evaluation data sets for both languages. NEAR yields better overall performance in Arabic than in English for comparable amounts of data, effectively using the POS tag information to improve performance. Our ap- proach achieves an Fβ=1score of 67.85% and 70.03% for raw English and Arabic data sets, respectively.

View PDFchevron_right
AIDA: An Online Tool for Accurate Disambiguation of Named Entities in Text and Tables
Ilaria Bordino

2011

We present AIDA, a framework and online tool for entity detection and disambiguation. Given a natural-language text or a Web table, we map mentions of ambiguous names onto canonical entities like people or places, registered in a knowledge base like DBpedia, Freebase, or YAGO. AIDA is a robust framework centred around collective disambiguation exploiting the prominence of entities, similarity between the context of the mention and its candidates, and the coherence among candidate entities for all mentions. We have developed a Web-based online interface for AIDA where different formats of inputs can be processed on the fly, returning proper entities and showing intermediate steps of the disambiguation process.

View PDFchevron_right
Improving Entity Resolution with Global Constraints
Benjamin Rubinstein

Arxiv preprint arXiv:1108.6016, 2011

Some of the greatest advances in web search have come from leveraging socioeconomic properties of online user behavior. Past advances include PageRank, anchor text, hubsauthorities, and TF-IDF. In this paper, we investigate another socioeconomic property that, to our knowledge, has not yet been exploited: sites that create lists of entities, such as IMDB and Netflix, have an incentive to avoid gratuitous duplicates. We leverage this property to resolve entities across the different web sites, and find that we can obtain substantial improvements in resolution accuracy. This improvement in accuracy also translates into robustness, which often reduces the amount of training data that must be labeled for comparing entities across many sites. Furthermore, the technique provides robustness when resolving sites that have some duplicates, even without first removing these duplicates. We present algorithms with very strong precision and recall, and show that max weight matching, while appearing to be a natural choice turns out to have poor performance in some situations. The presented techniques are now being used in the back-end entity resolution system at a major Internet search engine.

View PDFchevron_right
Who's Who In Your Digital Collection: Developing a Tool for Name Disambiguation and Identity Resolution
Patricia Hswe

Status: published or …, 2009

View PDFchevron_right
Efficient entity resolution for large heterogeneous information spaces
George Papadakis

Proceedings of the fourth ACM international conference on Web search and data mining - WSDM '11, 2011

We have recently witnessed an enormous growth in the volume of structured and semi-structured data sets available on the Web. An important prerequisite for using and combining such data sets is the detection and merge of information that describes the same real-world entities, a task known as Entity Resolution. To make this quadratic task efficient, blocking techniques are typically employed. However, the high dynamics, loose schema binding, and heterogeneity of (semi-)structured data, impose new challenges to entity resolution. Existing blocking approaches become inapplicable because they rely on the homogeneity of the considered data and a-priory known schemata. In this paper, we introduce a novel approach for entity resolution, scaling it up for large, noisy, and heterogeneous information spaces. It combines an attribute-agnostic mechanism for building blocks with intelligent block processing techniques that boost blocks with high expected utility, propagate knowledge about identified matches, and preempt the resolution process when it gets too expensive. Our extensive evaluation on real-world, large, heterogeneous data sets verifies that the suggested approach is both effective and efficient.

View PDFchevron_right
Quality-aware similarity assessment for entity matching in Web data
Surender Reddy

Information Systems

One of the key challenges to realize automated processing of the information on the Web, which is the central goal of the Semantic Web, is related to the entity matching problem. There are a number of tools that reliably recognize named entities, such as persons, companies, geographic locations, in Web documents. The names of these extracted entities are, however, non-unique; the same name on different Web pages might or might not refer to the same entity. The entity matching problem concerns of identifying the entities, which are referring to the same real-world entity. This problem is very similar to the entity resolution problem studied in relational databases, however, there are also several differences. Most importantly Web pages often only contain partial or incomplete information about the entities.

View PDFchevron_right
Entity name system: The back-bone of an open and scalable web of data
Paolo Bouquet

… Computing, 2008 IEEE …, 2008

An increased re-use of entity identifiers (or names) across different information collections such as RDF repositories, databases and document collections, eases this situation. In the ideal case, entity matching can be reduced to the trivial problem of spotting the same entity identifier in different information collections.

View PDFchevron_right
Entity Resolution for Multiple Sources with Extended Approach
phuc pham huu

Communications in computer and information science, 2023

Entity Resolution is a technique to find similar records that may refer to the same entity from one or many resources. It is mainly used in data integration or data cleaning with the existence of Big Data. It not only helps organisations have clean data, but it also provides a unified view of their data for later analysis. However, there is no one solution fitting all duplication issues. Because of the fact that the data itself is heterogeneous and varied. This paper focuses on finding the answers to the usefulness of a combination of different matching approaches, token blocking versus standard blocking and how other domain runs by examining how well they perform in different scenarios. To achieve these answers, this paper outline details and setups for these experiments to execute. A detailed evaluation demonstrates the effectiveness of the approaches with multiple datasets.

View PDFchevron_right

References (61)

  1. Auld, L. (1982). Authority control: An eight-year review. Library Resources and Technical Services, 26, 319-330.
  2. Bekkerman, R., & McCallum, A. (2005). Disambiguating web appearances of people in a social network. In Proceedings of the 14th World Wide Web Conference (pp. 463-470). New York: ACM Press.
  3. Benjelloun, O., Garcia-Molina, H., Kawai, H., Larson, T., Menestrina, D., & Thavisomboon, S. (2007). D-swoosh: A family of algorithms for generic, distributed entity resolution. In Proceedings of the 27th International Con- ference on Distributed Computing Systems (pp. 37-46). Washington, DC: IEEE Computer Society.
  4. Benjelloun, O., Garcia-Molina, H., Menestrina, D., Su, Q., Whang, S.E., & Widom, J. (2009). Swoosh: A generic approach to entity resolution. The VLDB Journal-The International Journal on Very Large Databases, 18(1), 255-276.
  5. Bennett, R., Hengel-Dittrich, C., O'Neill, E.T., & Tillett, B.B. (2006, August). Viaf (virtual international authority file): Linking Die Deutsche Bibliothek and Library of Congress name authority files. Paper presented at the World Library and Information Congress: 72nd IFLA General Conference and Council, Seoul, Korea.
  6. Bhattacharya, I., & Getoor, L. (2007). Collective entity resolution in rela- tional data.ACM Transaction on Knowledge Discovery from Data, 1(1), 5.
  7. Bilenko, M., Kamath, B., & Mooney, R.J. (2006). Adaptive blocking: Learning to scale up record linkage. Proceedings of the Sixth IEEE Inter- national Conference on Data Mining (pp. 87-96). Washington, DC: IEEE Computer Society.
  8. Bilenko, M., Mooney, R., Cohen, W., Ravikumar, P., & Fienberg, S. (2003). Adaptive name matching in information integration. IEEE Intelligent Systems, 18(5), 16-23.
  9. Bollegala, D., Honma, T., Matsuo, Y., & Ishizuka, M. (2008). Mining for personal name aliases on the web. In Proceedings of the 17th World Wide Web Conference (pp. 1107-1108). New York: ACM Press.
  10. Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5-32.
  11. Bunescu, R., & Pasca, M. (2006). Using encyclopedic knowledge for named entity disambiguation. In Proceedings of the 11th Conference of the Euro- pean Chapter of the Association for Computational Linguistics (pp. 9-16). Stroudsburg, PA: Association for Computational Linguistics.
  12. Cohen, W.W. (1998). Integration of heterogeneous databases without com- mon domains using queries based on textual similarity. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (pp. 201-212). New York, NY: ACM Press.
  13. Cohen, W.W., Ravikumar, P., & Fienberg, S.E. (2003). A comparison of string distance metrics for name-matching tasks. In Proceedings of IJCAI Workshop on Information Integration on the Web (pp. 73-78). Menlo Park, CA: Association for the Advancement of Artificial Intelligence.
  14. Cota, R.G., Ferreira, A.A., Nascimento, C., Gonçalves, M.A., & Laender, A.H.F. (2010). An unsupervised heuristic-based hierarchical method for name disambiguation in bibliographic citations. Journal of the American Society for Information Science and Technology, 61(9), 1853-1870.
  15. Croft, W.B., Metzler, D., & Strohman, T. (2009). Search engines: Information retrieval in practice. Reading, MA: Addison-Wesley.
  16. Davis, P.T., Elson, D.K., & Klavans, J.L. (2003). Methods for precise named entity matching in digital collections. In Proceedings of the Third ACM/IEEE-CS Joint Conference on Digital Libraries (pp. 125-127). New York: ACM Press.
  17. de Carvalho, M.G., Gonçalves, M.A., Laender, A.H.F., & da Silva, A.S. (2006). Learning to deduplicate. In Proceedings of the Sixth ACM/IEEE- CS Joint Conference on Digital Libraries (pp. 41-50). New York: ACM Press.
  18. Dong, X., Halevy, A., & Madhavan, J. (2005). Reference reconciliation in complex information spaces. In Proceedings of the 25th ACM SIGMOD International Conference on Management of Data (pp. 85-96). NewYork: ACM Press.
  19. Elmacioglu, E., Kan, M.-Y., Lee, D., & Zhang,Y. (2007). Web based linkage. In Proceedings of the Ninth Annual ACM International Workshop on Web Information and Data Management (pp. 121-128). NewYork: ACM Press.
  20. Elmagarmid, A.K., Ipeirotis, P.G., & Verykios, V.S. (2007). Duplicate record detection: A survey. IEEE Transaction on Knowledge and Data Engineering, 19(1), 1-16.
  21. Fellegi, I.P., & Sunter, A.B. (1969). A theory for record linkage. Journal of the American Statistical Association, 64(328), 1183-1210.
  22. French, J.C., Powell, A.L., & Schulman, E. (2000). Using clustering strate- gies for creating authority files. Journal of the American Society for Information Science, 51(8), 774-786.
  23. Google, A.P.I. (2009). Google ajax search api. Retrieved from http://code.google.com/apis/ajaxsearch
  24. Han, H., Giles, C.L., Zha, H., Li, C., & Tsioutsiouliklis, K. (2004). Two supervised learning approaches for name disambiguation in author cita- tions. In Proceedings of the Fourth ACM/IEEE-CS Joint Conference on Digital Libraries (pp. 296-305). New York: ACM Press.
  25. Han, H., Zha, H., & Giles, C.L. (2005). Name disambiguation in author cita- tions using a k-way spectral clustering method. In Proceedings of the Fifth ACM/IEEE-CS Joint Conference on Digital Libraries (pp. 334-343). New York: ACM Press.
  26. Hernández, M.A., & Stolfo, S.J. (1995). The merge/purge problem for large databases. ACM SIGMOD Record, 24(2), 127-138.
  27. Hickey, T.B., & O'Neill, J.T.E.T. (2006). NACO normalization: A detailed examination of the authority file comparison rules. Library Resources & Technical Services, 50(3), 166-172.
  28. Huang, J., Ertekin, S., & Giles, C.L. (2006). Efficient name disambiguation for large-scale databases. In Proceedings of the 10th European Confer- ence on Principles and Practice of Knowledge Discovery in Databases. Lecture Notes in Artificial Intelligence, 4213, 536-544.
  29. Jaccard, P. (1901). Étude comparative de la distribution florale dans une por- tion des Alpes et des Jura [Comparative study of the floral distribution in a portion of the Alps and the Jura]. Bulletin del la Société Vaudoise des Sciences Naturelles, Vol. 37 (1901), pp. 547-579.
  30. Jaro, M.A. (1989). Advances in record-linkage methodology as applied to matching the 1985 census of Tampa, Florida. Journal of the American Statistical Association, 84(406), 414-420.
  31. Kalashnikov, D.V., Nuray-Turan, R., & Mehrotra, S. (2008). Towards break- ing the quality curse: A web-querying approach to web people search. In Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 27-34. New York: ACM Press.
  32. Kan, M.-Y., & Tan, Y.F. (2008). Record matching in digital library metadata. Communications of the ACM, 51(2), 91-94.
  33. Kang, I.-S., Na, S.-H., Lee, S., Jung, H., Kim, P., Sung, W.-K., & Lee, J.-H. (2009). On co-authorship for author disambiguation. Information Processing & Management, 45(1), 84-97.
  34. Karypis, G., Han, E.-H., & Kumar, V. (1999). Chameleon: Hierarchical clustering using dynamic modeling. Computer, 32(8), 68-75.
  35. Kulkarni, S., Singh, A., Ramakrishnan, G., & Chakrabarti, S. (2009). Col- lective annotation of Wikipedia entities in web text. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 457-466). New York: ACM Press.
  36. Laender, A.H.F., Gonçalves, M.A., Cota, R.G., Ferreira, A.A., Santos, R.L.T., & Silva, A.J.C. (2008). Keeping a digital library clean: New solu- tions to old problems. In Proceedings of the Eighth ACM Symposium on Document Engineering (pp. 257-262). New York: ACM Press.
  37. Larkey, L.S., Ogilvie, P., Price, M.A., & Tamilio, B. (2000). Acrophile: An automated acronym extractor and server. In Proceedings of the Fifth ACM International Conference on Digital Libraries (pp. 205-214). New York: ACM Press.
  38. Lawrence, S., Giles, C.L., & Bollacker, K. (1999). Digital libraries and autonomous citation indexing. IEEE Computer, 32(6), 67-71.
  39. LEAF (2010). LEAF project consortium. Retrieved from http:// www.crxnet.com/leaf/
  40. Lee, D., Kang, J., Mitra, P., Giles, C.L., & On, B.-W. (2007). Are your citations clean? Communications of the ACM, 50(12), 33-38.
  41. Lee, D., On, B.-W., Kang, J., & Park, S. (2005). Effective and scalable solutions for mixed and split citation problems in digital libraries. In Proceedings of the Second International Workshop on Information Quality in Information Systems (pp. 69-76). New York: ACM Press.
  42. MacEwan, A. (2004). Project interparty: From library authority files to e-commerce. Cataloging & Classification Quarterly, 39(1 & 2), 429-442.
  43. McCallum,A., Nigam, K., & Ungar, L.H. (2000). Efficient clustering of high- dimensional data sets with application to reference matching. In Proceed- ings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 169-178). New York: ACM Press.
  44. Mihalcea, R., & Csomai, A. (2007). Wikify!: Linking documents to ency- clopedic knowledge. In Proceedings of the 16th ACM Conference on Information and Knowledge Management (pp. 233-242). NewYork:ACM Press.
  45. Milne, D., & Witten, I.H. (2008). Learning to link with Wikipedia. In Pro- ceedings of the 17th ACM Conference on Information and Knowledge Management (pp. 509-518). New York: ACM Press.
  46. On, B.-W., Lee, D., Kang, J., & Mitra, P. (2005). Comparative study of name disambiguation problem using a scalable blocking-based frame- work. In Proceedings of the Fifth ACM/IEEE-CS Joint Conference on Digital Libraries (pp. 344-353). New York: ACM Press.
  47. Pasula, H., Marthi, B., Milch, B., Russell, S., & Shpitser, I. (2002). Identity uncertainty and citation matching. Paper presented at Proceedings of the Advances in Neural Information Processing Systems (pp. 1401-1408). Cambridge, MA: MIT Press.
  48. Pereira, D.A., Ribeiro-Neto, B., Ziviani, N., & Laender,A.H.F. (2008). Using web information for creating publication venue authority files. In Proceed- ings of the Eighth ACM/IEEE-CS Joint Conference on Digital Libraries (pp. 295-304). New York: ACM Press.
  49. Pereira, D.A., Ribeiro-Neto, B., Ziviani, N., Laender, A.H.F., Gonçalves, M.A., & Ferreira, A.A. (2009). Using web information for author name disambiguation. In Proceedings of the Ninth ACM/IEEE-CS Joint Conference on Digital Libraries (pp. 49-58). New York: ACM Press.
  50. Sarawagi, S., & Bhamidipaty, A. (2002). Interactive deduplication using active learning. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 269-278). New York: ACM Press.
  51. sik Kim, H., & Lee, D. (2007). Parallel linkage. In Proceedings of the 16th ACM Conference on Information and Knowledge Management (pp. 283-292). New York: ACM Press.
  52. Snyman, M.M.M., & van Rensburg, M.J. (2000). Revolutionizing name authority control. In Proceedings of the Fifth ACM International Conference on Digital Libraries (pp. 185-194), San Antonio, TX.
  53. Song, Y., Huang, J., Councill, I.G., Li, J., & Giles, C.L. (2007). Effi- cient topic-based unsupervised name disambiguation. In Proceedings of the Seventh ACM/IEEE-CS Joint Conference on Digital Libraries (pp. 342-351). New York: ACM Press.
  54. Tan, Y.F., Kan, M.-Y., & Lee, D. (2006). Search engine driven author disam- biguation. In Proceedings of the Sixth ACM/IEEE-CS Joint Conference on Digital Libraries (pp. 314-315). New York: ACM Press.
  55. Tejada, S., Knoblock, C.A., & Minton, S. (2001). Learning object iden- tification rules for information integration. Information Systems, 26(8), 607-633.
  56. Tillett, B.B. (2004). Authority control: State of the art and new perspectives. Cataloging and Classification Quarterly, 38(3-4), 23-41.
  57. Vapnik, V.N. (1995). The nature of statistical learning theory. NewYork, NY: Springer.
  58. VIAF (2010). VIAF: The virtual international authority file. Retrieved from http://viaf.org/
  59. Warner, J.W., & Brown, E.W. (2001). Automated name authority control. In Proceedings of the First ACM/IEEE-CS Joint Conference on Digital Libraries (pp. 21-22). New York: ACM Press.
  60. Wick, M., Culotta, A., Rohanimanesh, K., & McCallum, A. (2009). An entity based model for coreference resolution. In Proceedings of the Ninth Society for Industrial and Applied Mathematics (SIAM) International Conference on Data Mining (pp. 365-376). Philadelphia, PA: Society for Industrial and Applied Mathematics.
  61. Xia, J. (2006). Personal name identification in the practice of digital repos- itories. Program: Electronic Library and Information Systems, 40(3), 256-267.

Related papers

Simplifying Entity Resolution on Web Data with Schema-Agnostic, Non-Iterative Matching
Vassilis Christophides

2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018

Entity Resolution (ER) aims to identify different descriptions in various Knowledge Bases (KBs) that refer to the same entity. ER is challenged by the Variety, Volume and Veracity of descriptions published in the Web of Data. To address them, we propose the MinoanER framework that fulfills full automation and support of highly heterogeneous entities. MinoanER leverages a token-based similarity of entities to define a new metric that derives the similarity of neighboring entities from the most important relations, indicated only by statistics. For high efficiency, similarities are computed from a set of schema-agnostic blocks and processed in a non-iterative way that involves four threshold-free heuristics. We demonstrate that the effectiveness of MinoanER is comparable to existing ER tools over real KBs exhibiting low heterogeneity in terms of entity types and content. Yet, MinoanER outperforms state-of-the-art ER tools when matching highly heterogeneous KBs.

View PDFchevron_right
Using web information for author name disambiguation
Denilson A Pereira

ACM/IEEE Joint Conference on Digital Libraries, 2009

In digital libraries, ambiguous author names may occur due to the existence of multiple authors with the same name (polysemes) or different name variations for the same author (synonyms). We proposed here a new method that uses information available on the Web to deal with both problems at the same time. Our idea consists of gathering information from input citations

View PDFchevron_right
A Method for Implementing Probabilistic Entity Resolution
Awaad Alsarkhi

International Journal of Advanced Computer Science and Applications

Deterministic and probabilistic are two approaches to matching commonly used in Entity Resolution (ER) systems. While many users are familiar with writing and using Boolean rules for deterministic matching, fewer are as familiar with the scoring rule configuration used to support probabilistic matching. This paper describes a method using deterministic matching to "bootstrap" probabilistic matching. It also examines the effectiveness three commonly used strategies to mitigate the effect of missing values when using probabilistic matching. The results based on experiment using different sets of synthetically generated data processed using the OYSTER open source entity resolution system.

View PDFchevron_right
ENCORE: Experiments with a Synthetic Entity Co-reference Resolution Tool
Anatole Gershman

cs.cmu.edu

We present ENCORE, a system for entity co-reference resolution that synthesizes the outputs of several off-the-shelf co-reference resolution systems. To boost precision, we filter the output using a named entity recognition tool called SYNERGY which itself is a synthesis of ...

View PDFchevron_right
Who's who in the world wide web: Approaches to name disambiguation
Vanessa Klaas

INSTITUT FUR INFORMATIK. der Ludwig-Maximilians- …, 2007

View PDFchevron_right

Related topics

  • Information Systems
  • Entity Resolution
  • Library and Information Studies

    • Cited by

    An association rules based method for classifying product offers from e-shopping
    denilson pereira

    Intelligent Data Analysis, 2017

    Price comparison services are widely used by e-shopping customers. Such e-shopping sites receive product offers from thousands of online stores, and in order to provide price comparison, product categorization, and searching, it is necessary to match different offers referring to the same real-world product. This is a hard task, since they need to classify millions of product offers in thousands of classes, and distinct descriptions may exist for the same product, as well as very similar descriptions of distinct products. In this work, we propose a method that uses association rules to classify product offers from e-shopping web sites matching offers against offers without the need for a product catalog. This is a supervised learning method that trains a classifier, whose generated model comprises a set of association rules to identify product offer classes. Experimental evaluations show that our method is effective and efficient, and obtains better results than three baselines in several datasets with distinct characteristics. It is able to deal with large datasets containing thousands of classes and different types of products such as electronics and books. Moreover, we propose and evaluate strategies to reduce its execution time and we evaluate its weaknesses.

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved