Demo Data from SIGIR 2026 / reviewers in the wild / expert
Moonjung Cho
dblp:02/1226
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 1 first-authorArtificial intelligence and machine learning · 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 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › clustering
pattern-based clustering |
0.0 | 1 | 2003 | MaPle: A Fast Algorithm for Maximal Pattern-based Clustering · ICDM 2003 |
Methods — techniques the papers use, named apart from their topics
divide-and-conquer · 0.0depth-first search · 0.0branch pruning · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Answering ad hoc aggregate queries from data streams using prefix aggregate trees
Moonjung Cho, Jian Pei 0001, Ke Wang 0001 |
Knowl. Inf. Syst. | 1 |
| 2005 | Cross Table Cubing: Mining Iceberg Cubes from Data WarehousesabstractAll of the existing (iceberg) cube computation algorithms assume that the data is stored in a single base table, however, in practice, a data warehouse is often organized in a schema of multiple tables, such as star schema and snowflake schema. In terms of both computation time and space, materializing a universal base table by joining multiple tables is often very expensive or even unaffordable in real data warehouses. In this paper, we investigate the problem of computing iceberg cubes from data warehouses. Surprisingly, our study shows that computing iceberg cube from multiple tables directly can be even more efficient in both space and runtime than computing from a materialized universal base table. We develop an efficient algorithm, CTC (for Cross Table Cubing) to tackle the problem. An extensive performance study on synthetic data sets demonstrates that our new approach is efficient and scalable for large data warehouses. Jian Pei 0001, Moonjung Cho, David Wai-Lok Cheung |
SDM | 2 |
| 2003 | MaPle: A Fast Algorithm for Maximal Pattern-based ClusteringabstractPattern-based clustering is important in many applications, such as DNA micro-array data analysis, automatic recommendation systems and target marketing systems. However, pattern-based clustering in large databases is challenging. On the one hand, there can be a huge number of clusters and many of them can be redundant and thus make the pattern-based clustering ineffective. On the other hand, the previous proposed methods may not be efficient or scalable in mining large databases. We study the problem of maximal pattern-based clustering. Redundant clusters are avoided completely by mining only the maximal pattern-based clusters. MaPle, an efficient and scalable mining algorithm is developed. It conducts a depth-first, divide-and-conquer search and prunes unnecessary branches smartly. Our extensive performance study on both synthetic data sets and real data sets shows that maximal pattern-based clustering is effective. It reduces the number of clusters substantially. Moreover, MaPle is more efficient and scalable than the previously proposed pattern-based clustering methods in mining large databases. Jian Pei 0001, Moonjung Cho, Haixun Wang, Philip S. Yu |
ICDM | 3 |