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

Tal Shaked

dblp:13/5062 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

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

Artificial intelligence and machine learning · 3Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1Applied, 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.

Artificial intelligence
4 papers
Information extraction and text analysis · 57% Optimization for machine learning · 16% Knowledge representation and reasoning · 14%
Databases, data mining, and information retrieval
3 papers
Information retrieval · 88% Web and social media mining · 12%
Human-computer interaction and pervasive computing
1 paper
User interface design and tools · 77% Ubiquitous computing and smart environments · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning › gradient-based optimization
gradient descent
0.112005
Learning to rank using gradient descent · ICML 2005
Natural language and speech › Information extraction and text analysis
named entity recognition
0.112005
Unsupervised named-entity extraction from the Web: An experimental study · Artif. Intell. 2005
Information retrieval › ranking
learning to rank
0.112005
Learning to rank using gradient descent · ICML 2005
Information retrieval
ranking
0.112005
Learning to rank using gradient descent · ICML 2005
User interface design and tools
user interface generation
0.112005
Fast and Robust Interface Generation for Ubiquitous Applications · UbiComp 2005
Machine learning › Trustworthy machine learning › uncertainty estimation
confidence estimation
0.012004
Web-scale information extraction in knowitall: (preliminary results) · WWW 2004
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › knowledge extraction
fact extraction
0.012004
Web-scale information extraction in knowitall: (preliminary results) · WWW 2004
Natural language and speech › Information extraction and text analysis › knowledge discovery from text
knowledge base population
0.012004
Web-scale information extraction in knowitall: (preliminary results) · WWW 2004
Natural language and speech › Information extraction and text analysis
web information extraction
0.012004
Methods for Domain-Independent Information Extraction from the Web: An Experimental Comparison · AAAI 2004
Natural language and speech › Information extraction and text analysis › web information extraction
web-scale information extraction
0.012004
Web-scale information extraction in knowitall: (preliminary results) · WWW 2004
Web and social media mining
web mining
0.012005
Unsupervised named-entity extraction from the Web: An experimental study · Artif. Intell. 2005
Information retrieval › query processing
web query processing
0.012004
Web-scale information extraction in knowitall: (preliminary results) · WWW 2004

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

unsupervised learning · 0.1probabilistic cost function · 0.1neural network · 0.1gradient descent · 0.1web crawling · 0.1probabilistic reasoning · 0.1
YearPublicationVenuePosition
2005 Fast and Robust Interface Generation for Ubiquitous Applications
Krzysztof Z. Gajos, David B. Christianson, Raphael Hoffmann, Tal Shaked, Kiera Henning, Jing Jing Long, Daniel S. Weld
UbiComp4
2005 Learning to rank using gradient descent
abstract
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data from a commercial internet search engine. 1.
Christopher J. C. Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, Gregory N. Hullender
ICML2
2005 Unsupervised named-entity extraction from the Web: An experimental study
Oren Etzioni, Michael J. Cafarella, Doug Downey, Ana-Maria Popescu, Tal Shaked, Stephen Soderland, Daniel S. Weld, Alexander Yates
Artif. Intell.5
2004 Methods for Domain-Independent Information Extraction from the Web: An Experimental Comparison
Oren Etzioni, Michael J. Cafarella, Doug Downey, Ana-Maria Popescu, Tal Shaked, Stephen Soderland, Daniel S. Weld, Alexander Yates
AAAI5
2004 Web-scale information extraction in knowitall: (preliminary results)
abstract
Manually querying search engines in order to accumulate a large bodyof factual information is a tedious, error-prone process of piecemealsearch. Search engines retrieve and rank potentially relevantdocuments for human perusal, but do not extract facts, assessconfidence, or fuse information from multiple documents. This paperintroduces KnowItAll, a system that aims to automate the tedious process ofextracting large collections of facts from the web in an autonomous,domain-independent, and scalable manner.The paper describes preliminary experiments in which an instance of KnowItAll, running for four days on a single machine, was able to automatically extract 54,753 facts. KnowItAll associates a probability with each fact enabling it to trade off precision and recall. The paper analyzes KnowItAll's architecture and reports on lessons learned for the design of large-scale information extraction systems.
Oren Etzioni, Michael J. Cafarella, Doug Downey, Stanley Kok, Ana-Maria Popescu, Tal Shaked, Stephen Soderland, Daniel S. Weld, Alexander Yates
WWW6
2003 Timing driven force directed placement with physical net constraints
abstract
This paper presents a new timing driven force directed placement algorithm that meets physical net length constraints as well as constraints on specific pin sets. It is the first force directed placement algorithm that meets precise half perimeter bounding box constraints on critical nets. It builds on the work of Eisenmann et al. [12], adding a new net model that changes the contribution of constrained nets in the quadratic programming problem, during solving for each force generation step. We propose several methods for selecting and constraining critical nets to achieve improved timing. Our work suggests that the force directed method with net constraints is a powerful tool for placement and timing convergence, achieving an average worst negative slack optimization exploitation of 64% and average total negative slack optimization exploitation of 48% results on 16 industry circuits from a 1.5GHz microprocessor.
Karthik Rajagopal, Tal Shaked, Yegna Parasuram, Tung Cao, Amit Chowdhary, Bill Halpin
ISPD2