◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Benjamin I. P. Rubinstein

School of Computing and Information Systems, University of Melbourne

66 papers hereh-index 355k citations134 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author4
  • middle author39
  • last author22

Across the 65 of 66 papers where every author was matched, so the position is known.

fields
  • cs.LG24
  • cs.CR15
  • cs.DB10
  • cs.CL5
  • cs.CV2
  • cs.SE2
affiliations
  • School of Computing and Information Systems, University of Melbourne
Homepage
same name
  • Benjamin I. P. Rubinstein — 6 papers, h 2
  • Benjamin I. P. Rubinstein — 5 papers, h 2
  • Benjamin I. P. Rubinstein — 5 papers, h 1
  • Benjamin I. P. Rubinstein — 4 papers, h 3
  • Benjamin I. P. Rubinstein — 2 papers, h 4
  • Benjamin I. P. Rubinstein — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20092024
most citedLearning in a Large Function Space: Privacy-Preserving Mechanisms for SVM Learning

51 citations · 348 across the 61 of their papers we have counts for

collaborators
Showing 2014Show all

3 papers · 1 filter

cs.DB2014

Principled Graph Matching Algorithms for Integrating Multiple Data Sources

Duo Zhang, Benjamin I. P. Rubinstein, Jim Gemmell

This paper explores combinatorial optimization for problems of max-weight graph matching on multi-partite graphs, which arise in integrating multiple data sources. Entity resolutio…

cs.LG2014★ 3 cited

Security Evaluation of Support Vector Machines in Adversarial Environments

Battista Biggio, Igino Corona, Blaine Nelson +5

Support Vector Machines (SVMs) are among the most popular classification techniques adopted in security applications like malware detection, intrusion detection, and spam filtering…

cs.LG2014

Bounding Embeddings of VC Classes into Maximum Classes

J. Hyam Rubinstein, Benjamin I. P. Rubinstein, Peter L. Bartlett

One of the earliest conjectures in computational learning theory-the Sample Compression conjecture-asserts that concept classes (equivalently set systems) admit compression schemes…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.