Eibe Frank

Prof. Eibe Frank

orcid

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2011
Verified
Book
Closed access
IWIan H. Witten
Ian H. Witten
EFEibe Frank
Eibe Frank
MHMark A. Hall
Mark A. Hall

30 June 2011 in Machine Learning
Verified
Journal Article
Closed access
PDF file
JRJesse Read
Jesse Read
BPBernhard Pfahringer
Bernhard Pfahringer
GHGeoff Holmes
Geoff Holmes
EFEibe Frank
Eibe Frank

1 May 2005 in Machine Learning
Verified
Journal Article
Closed access
PDF file
NLNiels Landwehr
Niels Landwehr
MHMark Hall
Mark Hall
EFEibe Frank
Eibe Frank

1 March 2002 in ACM SIGMOD Record
Verified
Journal Article
Open access
PDF file
IWIan H. Witten
Ian H. Witten
EFEibe Frank
Eibe Frank

8 April 2004 in Bioinformatics
Verified
Journal Article
Open access
PDF file
EFEibe Frank
Eibe Frank
MHMark Hall
Mark Hall
LTLen Trigg
Len Trigg
GHGeoffrey Holmes
Geoffrey Holmes
IWIan H. Witten
Ian H. Witten
Summary: The Weka machine learning workbench provides a general-purpose environment for automatic classification, regression, clustering and feature selection—common data mining problems in bioinformatics research. It contains an extensive collection of machine learning algorithms and data pre-processing methods complemented by graphical user interfaces for data exploration and the experimental comparison of different machine learning techniques on the same problem. Weka can process data given in the form of a single relational table. Its main objectives are to (a) assist users in extracting useful information from data and (b) enable them to easily identify a suitable algorithm for generating an accurate predictive model from it. Availability:http://www.cs.waikato.ac.nz/ml/weka

1 March 2010 in The Knowledge Engineering Review
Verified
Journal Article
Closed access
PDF file
JFJames Foulds
James Foulds
EFEibe Frank
Eibe Frank
Multi-instance (MI) learning is a variant of inductive machine learning, where each learning example contains a bag of instances instead of a single feature vector. The term commonly refers to the supervised setting, where each bag is associated with a label. This type of representation is a natural fit for a number of real-world learning scenarios, including drug activity prediction and image classification, hence many MI learning algorithms have been proposed. Any MI learning method must relate instances to bag-level class labels, but many types of relationships between instances and class labels are possible. Although all early work in MI learning assumes a specific MI concept class known to be appropriate for a drug activity prediction domain; this ‘standard MI assumption’ is not guaranteed to hold in other domains. Much of the recent work in MI learning has concentrated on a relaxed view of the MI problem, where the standard MI assumption is dropped, and alternative assumptions are considered instead. However, often it is not clearly stated what particular assumption is used and how it relates to other assumptions that have been proposed. In this paper, we aim to clarify the use of alternative MI assumptions by reviewing the work done in this area.