نتایج جستجو برای: record matching

تعداد نتایج: 200532  

Journal: :Comput. Graph. Forum 2011
Tianjia Shao Weiwei Xu KangKang Yin Jingdong Wang Kun Zhou Baining Guo

We propose a sketch-based 3D shape retrieval system that is substantially more discriminative and robust than existing systems, especially for complex models. The power of our system comes from a combination of a contourbased 2D shape representation and a robust sampling-based shape matching scheme. They are defined over discriminative local features and applicable for partial sketches; robust ...

Journal: :IEEE Intelligent Systems 2003
Mikhail Bilenko Raymond J. Mooney William W. Cohen Pradeep Ravikumar Stephen E. Fienberg

more complex examples of duplicate records that are not identical. Variations in representation across information sources can arise from differences in formats that store data, typographical and optical character recognition (OCR) errors, and abbreviations. Variations are particularly pronounced in data that’s automatically extracted from Web pages and unstructured or semistructured documents,...

2007
Elizabeth Huang Donald Malec Jerry Maples Lynn Weidman

In order to reduce variance and correct for coverage of ACS estimates, there is a desire for controlling estimates of demographic characteristics at the tract level. Currently, intercensal population controls are based on “usual residence” and are not available at the tract level, while the ACS produces estimates at the tract level that are based on “current residence”. This project proposes a ...

Journal: :Journal of experimental psychology. Animal learning and cognition 2015
William A Roberts Caroline Strang Krista Macpherson

Pigeons' performance on a working memory task, symbolic delayed matching-to-sample, was used to examine the interaction between working memory and reference memory. Reference memory was established by training pigeons to discriminate between the comparison cues used in delayed matching as S+ and S- stimuli. Delayed matching retention tests then measured accuracy when working and reference memor...

2015
Chunkun Bo Ke Wang Jeffrey J. Fox Kevin Skadron

Entity Resolution (ER), the process of finding identical entities across different databases, is critical to many information integration applications. As sizes of databases explode in the big-data era, it becomes computationally expensive to recognize identical entities for all possible records with variations allowed. Profiling results show that approximate matching is the primary bottleneck....

Mohammadi , Nazila, Sedaghat , Amin,

Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...

Journal: :Proceedings of the Royal Society of London. Series B: Biological Sciences 2001

2007
Joris Visser Maurice van Keulen Mannes Poel Ander de Keijzer

Finding nontrivial semantic matches between database schemas 3 Summary Automation of schema matching has been under investigation for already some decades, still the systems usually do not find all matches or suggests incorrect matches. Due to this imperfection matching schemas it is still often done manually by domain experts. The rapidly increasing number of heterogeneous and distributed data...

2006
Gang Alan Wang

Due to the rapid development of information technologies, especially the network technologies, business activities have never been as integrated as they are now. Business decision making often requires gathering information from different sources. This dissertation focuses on the problem of entity matching, associating corresponding information elements within or across information systems. It ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید