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

Llew Mason

dblp:37/5289 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
0since 2021 · last 2004
—ORCID · none

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

Artificial intelligence and machine learning · 8 · 3 first-authorDatabases, data management, data science and information retrieval · 2Theory of computation · 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
4 papers
Kernel, tree and ensemble methods · 52% Learning theory · 37% Optimization for machine learning · 11%
Databases, data mining, and information retrieval
2 papers
Data mining · 82% Data integration and cleaning · 18%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods
ensemble learning
0.021999
Boosting Algorithms as Gradient Descent · NIPS 1999
Direct Optimization of Margins Improves Generalization in Combined Classifiers · NIPS 1998
Machine learning › Kernel, tree and ensemble methods
decision tree learning
0.021999
The Alternating Decision Tree Learning Algorithm · ICML 1999
Generalization in Decision Trees and DNF: Does Size Matter? · NIPS 1997
Machine learning › Learning theory
generalization bounds
0.021998
Direct Optimization of Margins Improves Generalization in Combined Classifiers · NIPS 1998
Generalization in Decision Trees and DNF: Does Size Matter? · NIPS 1997
Data mining › pattern mining
association rule mining
0.012001
Real world performance of association rule algorithms · KDD 2001
Data mining
e-commerce data mining
0.012001
Integrating E-Commerce and Data Mining: Architecture and Challenges · ICDM 2001
Data mining › pattern mining › itemset mining
frequent itemset mining
0.012001
Real world performance of association rule algorithms · KDD 2001
Data mining
pattern mining
0.012001
Real world performance of association rule algorithms · KDD 2001
Machine learning › Kernel, tree and ensemble methods › ensemble learning
boosting
0.011999
Boosting Algorithms as Gradient Descent · NIPS 1999
Machine learning › Optimization for machine learning › gradient-based optimization
gradient descent
0.011999
Boosting Algorithms as Gradient Descent · NIPS 1999
Machine learning › Learning theory
margin maximization
0.011998
Direct Optimization of Margins Improves Generalization in Combined Classifiers · NIPS 1998
Machine learning › Learning theory › PAC learning
DNF learning
0.011997
Generalization in Decision Trees and DNF: Does Size Matter? · NIPS 1997
Data integration and cleaning › data preprocessing
data cleaning
0.012001
Integrating E-Commerce and Data Mining: Architecture and Challenges · ICDM 2001
Data integration and cleaning
data preprocessing
0.012001
Integrating E-Commerce and Data Mining: Architecture and Challenges · ICDM 2001
Data integration and cleaning
data warehouse
0.012001
Integrating E-Commerce and Data Mining: Architecture and Challenges · ICDM 2001

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

boosting · 0.1visualization · 0.0performance comparison · 0.0benchmarking · 0.0OLAP · 0.0gradient descent · 0.0decision tree · 0.0margin maximization · 0.0
YearPublicationVenuePosition
2004 Lessons and Challenges from Mining Retail E-Commerce Data
Ron Kohavi, Llew Mason, Rajesh Parekh, Zijian Zheng 0002
Mach. Learn.2
2002 Generalization Error of Combined Classifiers
Llew Mason, Peter L. Bartlett, Mostefa Golea
J. Comput. Syst. Sci.1
2001 Integrating E-Commerce and Data Mining: Architecture and Challenges
abstract
We show that the e-commerce domain can provide all the right ingredients for successful data mining. We describe an integrated architecture for supporting this integration. The architecture can dramatically reduce the pre-processing, cleaning, and data understanding effort often documented to take 80% of the time in knowledge discovery projects. We emphasize the need for data collection at the application server layer (not the Web server) in order to support logging of data and metadata that is essential to the discovery process. We describe the data transformation bridges required from the transaction processing systems and customer event streams (e.g., clickstreams) to the data warehouse. We detail the mining workbench, which needs to provide multiple views of the data through reporting, data mining algorithms, visualization, and OLAP. We conclude with a set of challenges.
Suhail Ansari, Ron Kohavi, Llew Mason, Zijian Zheng 0002
ICDM3
2001 Real world performance of association rule algorithms
abstract
This study compares five well-known association rule algorithms using three real-world datasets and an artificial dataset. The experimental results confirm the performance improvements previously claimed by the authors on the artificial data, but some of these gains do not carry over to the real datasets, indicating overfitting of the algorithms to the IBM artificial dataset. More importantly, we found that the choice of algorithm only matters at support levels that generate more rules than would be useful in practice. For support levels that generate less than 1,000,000 rules, which is much more than humans can handle and is sufficient for prediction purposes where data is loaded into RAM, Apriori finishes processing in less than 10 minutes. On our datasets, we observed super-exponential growth in the number of rules. On one of our datasets, a 0.02% change in the support increased the number of rules from less than a million to over a billion, implying that outside a very narrow range of support values, the choice of algorithm is irrelevant.
Zijian Zheng 0002, Ron Kohavi, Llew Mason
KDD3
2000 Improved Generalization Through Explicit Optimization of Margins
Llew Mason, Peter L. Bartlett, Jonathan Baxter
Mach. Learn.1
1999 The Alternating Decision Tree Learning Algorithm
Yoav Freund, Llew Mason
ICML2
1999 Boosting Algorithms as Gradient Descent
Llew Mason, Jonathan Baxter, Peter L. Bartlett, Marcus Frean
NIPS1
1998 Direct Optimization of Margins Improves Generalization in Combined Classifiers
Llew Mason, Peter L. Bartlett, Jonathan Baxter
NIPS1
1997 Generalization in Decision Trees and DNF: Does Size Matter?
Mostefa Golea, Peter L. Bartlett, Wee Sun Lee, Llew Mason
NIPS4