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

Elsa Loekito

dblp:22/1608 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2010
—ORCID · none

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

Databases, data management, data science and information retrieval · 5 · 4 first-authorArtificial intelligence and machine learning · 2 · 2 first-authorTheory of computation · 1

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
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › pattern mining › subgroup discovery
contrast set mining
0.112006
Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams · KDD 2006
Data mining › pattern mining › discriminative pattern mining
emerging pattern mining
0.112006
Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams · KDD 2006
Data mining
pattern mining
0.112006
Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams · KDD 2006
Data mining › high-dimensional data analysis
high-dimensional data mining
0.012006
Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams · KDD 2006

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

zero-suppressed binary decision diagram · 0.1
YearPublicationVenuePosition
2010 Efficient incremental mining of contrast patterns in changing data
James Bailey 0001, Elsa Loekito
Inf. Process. Lett.2
2010 A binary decision diagram based approach for mining frequent subsequences
Elsa Loekito, James Bailey 0001, Jian Pei 0001
Knowl. Inf. Syst.1
2009 Using Highly Expressive Contrast Patterns for Classification - Is It Worthwhile?
Elsa Loekito, James Bailey 0001
PAKDD1
2008 Mining influential attributes that capture class and group contrast behaviour
abstract
Contrast data mining is a key tool for finding differences between sets of objects, or classes, and contrast patterns are a popular method for discrimination between two classes. However, such patterns can be limited in two primary ways: i) They do not readily allow second order differentiation - i.e. discovering contrasts of contrasts, ii) Mining contrast patterns often results in an overwhelming volume of output for the user. To address these limitations, this paper proposes a method which can identify contrast behaviour across both classes and also groups of classes. Furthermore, to increase interpretability for the user, it presents a new technique for finding the attributes which represent the key underlying factors behind the contrast behaviour. The associated mining task is computationally challenging and we describe an efficient algorithm to handle it, based on binary decision diagrams. Experimental results demonstrate that our technique can efficiently identify and explain contrast behaviour which would be difficult or impossible to isolate using standard techniques.
Elsa Loekito, James Bailey 0001
CIKM1
2006 Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams
abstract
Patterns of contrast are a very important way of comparing multi-dimensional datasets. Such patterns are able to capture regions of high difference between two classes of data, and are useful for human experts and the construction of classifiers. However, mining such patterns is particularly challenging when the number of dimensions is large. This paper describes a new technique for mining several varieties of contrast pattern, based on the use of Zero-Suppressed Binary Decision Diagrams (ZBDDs), a powerful data structure for manipulating sparse data. We study the mining of both simple contrast patterns, such as emerging patterns, and more novel and complex contrasts, which we call disjunctive emerging patterns. A performance study demonstrates our ZBDD technique is highly scalable, substantially improves on state of the art mining for emerging patterns and can be effective for discovering complex contrasts from datasets with thousands of attributes.
Elsa Loekito, James Bailey 0001
KDD1