James P. Sweeney

dblp:60/6667 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1 · 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.

Artificial intelligence
1 paper
Language models and text generation · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › text summarization
graph-based summarization
0.112006
LexNet: A Graphical Environment for Graph-Based NLP · ACL 2006
Natural language and speech › Language models and text generation
text summarization
0.112006
LexNet: A Graphical Environment for Graph-Based NLP · ACL 2006
Information retrieval › retrieval models
graph-based retrieval
0.112006
LexNet: A Graphical Environment for Graph-Based NLP · ACL 2006
Information retrieval › retrieval models
random walk models
0.112006
LexNet: A Graphical Environment for Graph-Based NLP · ACL 2006

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

random walk · 0.1lexrank · 0.1
YearPublicationVenuePosition
2008 Heuristic solutions to resource allocation in grid computing: a natural approach
James P. Sweeney, Sanjay P. Ahuja
J. Supercomput.1
2006 LexNet: A Graphical Environment for Graph-Based NLP
abstract
This interactive presentation describes LexNet, a graphical environment for graph-based NLP developed at the University of Michigan. LexNet includes LexRank (for text summarization), biased LexRank (for passage retrieval), and TUMBL (for binary classification). All tools in the collection are based on random walks on lexical graphs, that is graphs where different NLP objects (e.g., sentences or phrases) are represented as nodes linked by edges proportional to the lexical similarity between the two nodes. We will demonstrate these tools on a variety of NLP tasks including summarization, question answering, and prepositional phrase attachment.
Dragomir R. Radev, Günes Erkan, Anthony Fader, Patrick Jordan, Siwei Shen, James P. Sweeney
ACL6