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

Nadav Eiron

dblp:35/2808 · DBLP profile ↗
← Back
18ranked-venue papers
3as first author
0since 2021 · last 2006
—ORCID · none

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

Artificial intelligence and machine learning · 8Databases, data management, data science and information retrieval · 7 · 2 first-authorTheory of computation · 4 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 1 first-author

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.

Databases, data mining, and information retrieval
4 papers
Information retrieval · 82% Knowledge graphs · 16% Web and social media mining · 2%
Artificial intelligence
4 papers
Learning theory · 82% Knowledge representation and reasoning · 13% Learning paradigms · 5%
Theoretical computer science
2 papers
Computational complexity · 67% Algorithms and data structures · 33%

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

TopicWeightPapersLastEvidence papers
Information retrieval
web search
0.122004
Ranking the web frontier · WWW 2004
Analysis of anchor text for web search · SIGIR 2003
Information retrieval › document retrieval › domain-specific retrieval
enterprise search
0.112006
Using annotations in enterprise search · WWW 2006
Information retrieval
ranking
0.112006
Using annotations in enterprise search · WWW 2006
Information retrieval
retrieval models
0.112006
Using annotations in enterprise search · WWW 2006
Machine learning › Learning theory
query learning
0.022002
Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries · J. Mach. Learn. Res. 2002
On Self-Directed Learning · COLT 1995
Information retrieval › web search
link analysis
0.012004
Ranking the web frontier · WWW 2004
Information retrieval › ranking › search ranking
web ranking
0.012004
Ranking the web frontier · WWW 2004
Information retrieval › web search
anchor text
0.012003
Analysis of anchor text for web search · SIGIR 2003
Knowledge graphs
ontology
0.012003
SemTag and seeker: bootstrapping the semantic web via automated semantic annotation · WWW 2003
Knowledge graphs › semantic web
semantic annotation
0.012003
SemTag and seeker: bootstrapping the semantic web via automated semantic annotation · WWW 2003
Machine learning › Learning theory
computational learning theory
0.012002
Limitations of Learning Via Embeddings in Euclidean Half Spaces · J. Mach. Learn. Res. 2002
Knowledge, reasoning and agents › Knowledge representation and reasoning
concept learning
0.012002
Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries · J. Mach. Learn. Res. 2002
Machine learning › Learning theory › query learning
membership queries
0.012002
Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries · J. Mach. Learn. Res. 2002
Machine learning › Learning theory › computational learning theory › monotone function learning
monotone DNF
0.012002
Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries · J. Mach. Learn. Res. 2002
Machine learning › Learning theory › PAC learning
agnostic learning
0.012000
On the Difficulty of Approximately Maximizing Agreements · COLT 2000
Computational complexity
hardness of approximation
0.012000
On the Difficulty of Approximately Maximizing Agreements · COLT 2000
Information retrieval › search engines
web crawling
0.012004
Ranking the web frontier · WWW 2004
Machine learning › Learning paradigms
self-directed learning
0.011995
On Self-Directed Learning · COLT 1995
Information retrieval
text analysis
0.012003
SemTag and seeker: bootstrapping the semantic web via automated semantic annotation · WWW 2003
Web and social media mining › web mining
web link analysis
0.012003
Analysis of anchor text for web search · SIGIR 2003

Methods — techniques the papers use, named apart from their topics

user annotations · 0.1explicit and implicit feedback · 0.1pagerank · 0.0disambiguation algorithm · 0.0anchor text analysis · 0.0membership queries · 0.0equivalence queries · 0.0
YearPublicationVenuePosition
2006 Indexing Shared Content in Information Retrieval Systems
Andrei Z. Broder, Nadav Eiron, Marcus Fontoura, Michael Herscovici, Ronny Lempel, John McPherson, Runping Qi, Eugene J. Shekita
EDBT2
2006 Using annotations in enterprise search
abstract
A major difference between corporate intranets and the Internet is that in intranets the barrier for users to create web pages is much higher. This limits the amount and quality of anchor text, one of the major factors used by Internet search engines, making intranet search more difficult. The social phenomenon at play also means that spam is relatively rare. Both on the Internet and in intranets, users are often willing to cooperate with the search engine in improving the search experience. These characteristics naturally lead to considering using user feedback to improve search quality in intranets. In this paper we show how a particular form of feedback, namely user annotations, can be used to improve the quality of intranet search. An annotation is a short description of the contents of a web page, which can be considered a substitute for anchor text. We propose two ways to obtain user annotations, using explicit and implicit feedback, and show how they can be integrated into a search engine. Preliminary experiments on the IBM intranet demonstrate that using annotations improves the search quality.
Pavel A. Dmitriev, Nadav Eiron, Marcus Fontoura, Eugene J. Shekita
WWW2
2005 Static score bucketing in inverted indexes
abstract
Maintaining strict static score order of inverted lists is a heuristic used by search engines to improve the quality of query results when the entire inverted lists cannot be processed. This heuristic, however, increases the cost of index generation and requires complex index build algorithms. In this paper, we study a new index organization based on static score bucketing. We show that this new technique significantly improves in index build performance while having minimal impact on the quality of search results.
Chavdar Botev, Nadav Eiron, Marcus Fontoura, Eugene J. Shekita
CIKM2
2004 Links in Hierarchical Information Networks
Nadav Eiron, Kevin S. McCurley
WAW1
2004 Ranking the web frontier
abstract
The celebrated PageRank algorithm has proved to be a very effective paradigm for ranking results of web search algorithms. In this paper we refine this basic paradigm to take into account several evolving prominent features of the web, and propose several algorithmic innovations. First, we analyze features of the rapidly growing "frontier" of the web, namely the part of the web that crawlers are unable to cover for one reason or another. We analyze the effect of these pages and find it to be significant. We suggest ways to improve the quality of ranking by modeling the growing presence of "link rot" on the web as more sites and pages fall out of maintenance. Finally we suggest new methods of ranking that are motivated by the hierarchical structure of the web, are more efficient than PageRank, and may be more resistant to direct manipulation.
Nadav Eiron, Kevin S. McCurley, John A. Tomlin
WWW1
2003 Analysis of anchor text for web search
abstract
No abstract available.
Nadav Eiron, Kevin S. McCurley
SIGIR1
2003 SemTag and seeker: bootstrapping the semantic web via automated semantic annotation
abstract
This paper describes Seeker, a platform for large-scale text analytics, and SemTag, an application written on the platform to perform automated semantic tagging of large corpora. We apply SemTag to a collection of approximately 264 million web pages, and generate approximately 434 million automatically disambiguated semantic tags, published to the web as a label bureau providing metadata regarding the 434 million annotations. To our knowledge, this is the largest scale semantic tagging effort to date.We describe the Seeker platform, discuss the architecture of the SemTag application, describe a new disambiguation algorithm specialized to support ontological disambiguation of large-scale data, evaluate the algorithm, and present our final results with information about acquiring and making use of the semantic tags. We argue that automated large scale semantic tagging of ambiguous content can bootstrap and accelerate the creation of the semantic web.
Stephen Dill, Nadav Eiron, David Gibson, Daniel Gruhl, Ramanathan V. Guha, Anant Jhingran, Tapas Kanungo, Sridhar Rajagopalan, Andrew Tomkins, John A. Tomlin, Jason Y. Zien
WWW2
2003 On the difficulty of approximately maximizing agreements
Shai Ben-David, Nadav Eiron, Philip M. Long
J. Comput. Syst. Sci.2
2003 A case for automated large-scale semantic annotation
Stephen Dill, Nadav Eiron, David Gibson, Daniel Gruhl, Ramanathan V. Guha, Anant Jhingran, Tapas Kanungo, Kevin S. McCurley, Sridhar Rajagopalan, Andrew Tomkins, John A. Tomlin, Jason Y. Zien
J. Web Semant.2
2002 The Computational Complexity of Densest Region Detection
Shai Ben-David, Nadav Eiron, Hans Simon 0001
J. Comput. Syst. Sci.2
2002 Limitations of Learning Via Embeddings in Euclidean Half Spaces
Shai Ben-David, Nadav Eiron, Hans Simon 0001
J. Mach. Learn. Res.2
2002 Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries
Nader H. Bshouty, Nadav Eiron
J. Mach. Learn. Res.2
2002 PAC learning with nasty noise
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
Theor. Comput. Sci.2
2000 On the Difficulty of Approximately Maximizing Agreements
Shai Ben-David, Nadav Eiron, Philip M. Long
COLT2
2000 The Computational Complexity of Densest Region Detection
Shai Ben-David, Nadav Eiron, Hans Simon 0001
COLT2
1999 PAC Learning with Nasty Noise
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
ALT2
1998 Self-Directed Learning and Its Relation to the VC-Dimension and to Teacher-Directed Learning
Shai Ben-David, Nadav Eiron
Mach. Learn.2
1995 On Self-Directed Learning
abstract
We study several issues concerning the selfdmected model of learning [G RS93, GS94).In of queries it has to go through.
Shai Ben-David, Nadav Eiron, Eyal Kushilevitz
COLT2