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

Zvika Marx

dblp:23/6309 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2011
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 4 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
3 papers
Data mining · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.132003
Identifying Structure across Pre-partitioned Data · NIPS 2003
Coupled Clustering: A Method for Detecting Structural Correspondence · J. Mach. Learn. Res. 2002
Coupled Clustering: a Method for Detecting Structural Correspondence · ICML 2001
Natural language and speech › Information extraction and text analysis › lexical semantics › verb semantics
verb class induction
0.012003
Clustering Polysemic Subcategorization Frame Distributions Semantically · ACL 2003
Data mining › clustering
information-theoretic clustering
0.012003
Identifying Structure across Pre-partitioned Data · NIPS 2003
Computational social science and digital humanities
text analysis
0.012003
Identifying Structure across Pre-partitioned Data · NIPS 2003

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

pre-partition factor · 0.1information-theoretic clustering · 0.1coupled clustering · 0.1nearest neighbor clustering · 0.0information bottleneck · 0.0
YearPublicationVenuePosition
2011 Cross-partition clustering: revealing corresponding themes across related datasets
abstract
This article studies the task of discovering correspondences across related domains based on real-world data collections. We address this task through a designated extension of distributional data-clustering methods. The method is empirically demonstrated on synthetic data as well as on texts addressing different religions, where the goal is to identify commonalities shared by all religions. This article generalises and demonstrates the empirical improvement relative to our previous studies on this subject, as well as to other comparable methods.
Zvika Marx, Ido Dagan, Eli Shamir 0001
J. Exp. Theor. Artif. Intell.1
2003 Clustering Polysemic Subcategorization Frame Distributions Semantically
abstract
Previous research has demonstrated the utility of clustering in inducing semantic verb classes from undisambiguated corpus data. We describe a new approach which involves clustering subcategorization frame (SCF) distributions using the Information Bottleneck and nearest neighbour methods. In contrast to previous work, we particularly focus on clustering polysemic verbs. A novel evaluation scheme is proposed which accounts for the effect of polysemy on the clusters, offering us a good insight into the potential and limitations of semantically classifying undisambiguated SCF data.
Anna Korhonen, Yuval Krymolowski, Zvika Marx
ACL3
2003 Identifying Structure across Pre-partitioned Data
abstract
We propose an information-theoretic clustering approach that incorporates a pre-known partition of the data, aiming to identify common clusters that cut across the given partition. In the standard clustering setting the formation of clusters is guided by a single source of feature information. The newly utilized pre-partition factor introduces an additional bias that counterbalances the impact of the features whenever they become correlated with this known partition. The resulting algorithmic framework was applied successfully to synthetic data, as well as to identifying text-based cross-religion correspondences.
Zvika Marx, Ido Dagan, Eli Shamir 0001
NIPS1
2002 Cross-dataset Clustering: Revealing Corresponding Themes across Multiple Corpora
Ido Dagan, Zvika Marx, Eli Shamir 0001
CoNLL2
2002 Coupled Clustering: A Method for Detecting Structural Correspondence
Zvika Marx, Ido Dagan, Joachim M. Buhmann, Eli Shamir 0001
J. Mach. Learn. Res.1
2001 Coupled Clustering: a Method for Detecting Structural Correspondence
Zvika Marx, Ido Dagan, Joachim M. Buhmann
ICML1