Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Efficient Name Disambiguation for Large-Scale Databases
Date
2006-01-01
Author
Huang, Jian
Ertekin Bolelli, Şeyda
Giles, C Lee
Metadata
Show full item record
Item Usage Stats
49
views
0
downloads
Cite This
URI
https://doi.org/10.1007/11871637_53
https://hdl.handle.net/11511/74756
Relation
Knowledge Discovery in Databases: PKDD 2006
Collections
Department of Computer Engineering, Book / Book chapter
Suggestions
OpenMETU
Core
Efficient name disambiguation for large-scale databases
Huang, Jian; Ertekin Bolelli, Şeyda; Giles, C. Lee (2006-01-01)
Name disambiguation can occur when one is seeking a list of publications of an author who has used different name variations and when there are multiple other authors with the same name. We present an efficient integrative framework for solving the name disambiguation problem: a blocking method retrieves candidate classes of authors with similar names and a clustering method, DBSCAN, clusters papers by author. The distance metric between papers used in DBSCAN is calculated by an online active selection supp...
Efficient Name Disambiguation for Large Scale Datasets.
Huang, Jian; Ertekin Bolelli, Şeyda; Giles, C Lee (2006-09-18)
Name disambiguation can occur when one is seeking a list of publications of an author who has used different name variations and when there are multiple other authors with the same name. We present an efficient integrative framework for solving the name disambiguation problem: a blocking method retrieves candidate classes of authors with similar names and a clustering method, DBSCAN, clusters papers by author. The distance metric between papers used in DBSCAN is calculated by an online active selection supp...
Efficient index structures for video databases
Açar, Esra; Yazıcı, Adnan; Department of Computer Engineering (2008)
Content-based retrieval of multimedia data has been still an active research area. The efficient retrieval of video data is proven a difficult task for content-based video retrieval systems. In this thesis study, a Content-Based Video Retrieval (CBVR) system that adapts two different index structures, namely Slim-Tree and BitMatrix, for efficiently retrieving videos based on low-level features such as color, texture, shape and motion is presented. The system represents low-level features of video data with ...
Efficient structural optimization for multiple load cases using adjoint sensitivities
Akgun, MA; Haftka, RT; Wu, KC; Walsh, JL; Garcelon, JH (American Institute of Aeronautics and Astronautics (AIAA), 2001-03-01)
Adjoint sensitivity calculation of stress, buckling, and displacement constraints may be much less expensive than direct sensitivity calculation when the number of load cases is large. In general, it is more difficult to implement the adjoint method than the direct method, but it is shown that the use of the continuum adjoint method, along with homogeneity conditions, can alleviate the problem. Expressions for von Mises stress and local buckling sensitivities For isotropic plate elements are derived. Comput...
Efficient Multiclass Boosting Classification with Active Learning
Huang, Jian; Ertekin Bolelli, Şeyda; Song, Yang; Zha, Hongyuan; Giles, C. Lee (2007-01-01)
We propose a novel multiclass classification algorithm Gentle Adaptive Multiclass Boosting Learning (GAMBLE). The algorithm naturally extends the two class Gentle AdaBoost algorithm to multiclass classification by using the multiclass exponential loss and the multiclass response encoding scheme. Unlike other multiclass algorithms which reduce the K-class classification task to K binary classifications, GAMBLE handles the task directly and symmetrically, with only one committee classifier. We formally derive...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
J. Huang, Ş. Ertekin Bolelli, and C. L. Giles,
Efficient Name Disambiguation for Large-Scale Databases
. 2006, p. 544.