Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ilan Gronau

dblp:00/1179 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
1since 2021 · last 2022
0000-0001-8536-4062ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 3 first-author · 1 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
phylogenetics
0.112008
Fast and reliable reconstruction of phylogenetic trees with very short edges · SODA 2008
Bioinformatics and computational biology › phylogenetics
phylogenetic inference
0.112008
Fast and reliable reconstruction of phylogenetic trees with very short edges · SODA 2008
Algorithms and data structures › computational biology
tree reconstruction
0.112008
Fast and reliable reconstruction of phylogenetic trees with very short edges · SODA 2008
YearPublicationVenuePosition
2022 CompanyName2Vec: Company Entity Matching based on Job Ads
abstract
Entity Matching is an essential part of all real-world systems that take in structured and unstructured data coming from different sources. Typically no common key is available for connecting records. Massive data cleaning and integration processes require completion before any data analytics, or further processing can be performed. Although record linkage is frequently regarded as a somewhat tedious but necessary step, it reveals valuable insights, supports data visualization, and guides further analytic approaches to the data. Here, we focus on organization entity matching. We introduce CompanyName2Vec, a novel algorithm to solve company entity matching (CEM) using a neural network model to learn company name semantics from a job ad corpus, without relying on any information on the matched company besides its name. Based on a real-world data, we show that CompanyName2Vec outperforms other evaluated methods and solves the CEM challenge with an average success rate of 89.3%.
Ran Ziv, Ilan Gronau, Michael Fire
DSAA2
2011 Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions - (Extended Abstract)
Daniel Doerr, Ilan Gronau, Shlomo Moran, Irad Yavneh
WABI2
2008 Fast and reliable reconstruction of phylogenetic trees with very short edges
Ilan Gronau, Shlomo Moran, Sagi Snir
SODA1
2007 Optimal implementations of UPGMA and other common clustering algorithms
Ilan Gronau, Shlomo Moran
Inf. Process. Lett.1
2007 On the hardness of inferring phylogenies from triplet-dissimilarities
Ilan Gronau, Shlomo Moran
Theor. Comput. Sci.1