EDBT 2026 Demo / reviewers in the wild / expert
Xika Lin
dblp:131/4098
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2016
0000-0001-6919-7831ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 5 · 2 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
3 papers |
Data mining · 94% Query processing and optimization · 6% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › pattern mining
association rule mining |
0.5 | 3 | 2014 | SPIRE: Supporting Parameter-Driven Interactive Rule Mining and Exploration · Proc. VLDB Endow. 2014 PARAS: A Parameter Space Framework for Online Association Mining · Proc. VLDB Endow. 2013 PARAS: interactive parameter space exploration for association rule mining · SIGMOD Conference 2013 |
Data mining › pattern mining › association rule mining
negative association rule |
0.2 | 1 | 2014 | SPIRE: Supporting Parameter-Driven Interactive Rule Mining and Exploration · Proc. VLDB Endow. 2014 |
Visualization and visual analytics › information visualization › knowledge visualization
rule visualization |
0.1 | 1 | 2014 | SPIRE: Supporting Parameter-Driven Interactive Rule Mining and Exploration · Proc. VLDB Endow. 2014 |
Query processing and optimization › interactive query processing
exploratory query |
0.0 | 1 | 2013 | PARAS: A Parameter Space Framework for Online Association Mining · Proc. VLDB Endow. 2013 |
Methods — techniques the papers use, named apart from their topics
region-wise abstraction · 0.4redundancy management · 0.4stable region abstraction · 0.2parameter space model · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Interactive Temporal Association Analytics
Xiao Qin 0003, Ramoza Ahsan, Xika Lin, Elke A. Rundensteiner, Matthew O. Ward |
EDBT | 3 |
| 2014 | SPIRE: Supporting Parameter-Driven Interactive Rule Mining and ExplorationabstractWe demonstrate our SPIRE technology for supporting interactive mining of both positive and negative rules at the speed of thought. It is often misleading to learn only about positive rules, yet extremely revealing to find strongly supported negative rules. Key technical contributions of SPIRE including region-wise abstractions of rules, positive-negative rule relationship analysis, rule redundancy management and rule visualization supporting novel exploratory queries will be showcased. The audience can interactively explore complex rule relationships in a visual manner, such as comparing negative rules with their positive counterparts, that would otherwise take prohibitive time. Overall, our SPIRE system provides data analysts with rich insights into rules and rule relationships while significantly reducing manual effort and time investment required. Xika Lin, Abhishek Mukherji, Elke A. Rundensteiner, Matthew O. Ward |
Proc. VLDB Endow. | 1 |
| 2013 | FIRE: interactive visual support for parameter space-driven rule miningabstractWhile significant strides have been made on efficient association rule mining, the usability of mining systems woefully lags behind. In particular, the usability of rule mining systems is limited by the lack of support for interactive exploration of the relationships among rule results produced with various parameter settings. Based on a novel parameter space-driven approach, our proposed Framework for Interactive Rule Exploration (FIRE) addresses the usability shortcoming. FIRE features innovative visual displays and effective interactions that enable analysts to conduct rule exploration at the speed of thought. Particularly, the parameter space view (PSpace) displays the distribution of rules produced for diverse parameter settings. This not only facilitates user parameter selection but also empowers analyst's to understand rule relationships in the parameter space context. Our user study with 22 subjects establishes the usability and effectiveness of the proposed features and interactions of FIRE using benchmark datasets. Overall, this research encompasses significant contributions at the intersection of data mining, knowledge management and visual analytics. Abhishek Mukherji, Xika Lin, Jason Whitehouse, Christopher R. Botaish, Elke A. Rundensteiner, Matthew O. Ward |
CIKM | 2 |
| 2013 | PARAS: interactive parameter space exploration for association rule miningabstractWe demonstrate our PARAS technology for supporting interactive association mining at near real-time speeds. Key technical innovations of PARAS, in particular, stable region abstractions and rule redundancy management supporting novel parameter space-centric exploratory queries will be showcased. The audience will be able to interactively explore the parameter space view of rules. They will experience near real-time speeds achieved by PARAS for operations, such as comparing rule sets mined using different parameter values, that would otherwise take hours of computation and much manual investigation. Overall, we will demonstrate that the PARAS system provides a rich experience to data analysts through parameter tuning recommendations while significantly reducing the trial-and-error interactions. Abhishek Mukherji, Xika Lin, Christopher R. Botaish, Jason Whitehouse, Elke A. Rundensteiner, Matthew O. Ward, Carolina Ruiz |
SIGMOD Conference | 2 |
| 2013 | PARAS: A Parameter Space Framework for Online Association MiningabstractAssociation rule mining is known to be computationally intensive, yet real-time decision-making applications are increasingly intolerant to delays. In this paper, we introduce the parameter space model, called PARAS. PARAS enables efficient rule mining by compactly maintaining the final rulesets. The PARAS model is based on the notion of stable region abstractions that form the coarse granularity ruleset space. Based on new insights on the redundancy relationships among rules, PARAS establishes a surprisingly compact representation of complex redundancy relationships while enabling efficient redundancy resolution at query-time. Besides the classical rule mining requests, the PARAS model supports three novel classes of exploratory queries. Using the proposed PSpace index, these exploratory query classes can all be answered with near real-time responsiveness. Our experimental evaluation using several benchmark datasets demonstrates that PARAS achieves 2 to 5 orders of magnitude improvement over state-of-the-art approaches in online association rule mining. Xika Lin, Abhishek Mukherji, Elke A. Rundensteiner, Carolina Ruiz, Matthew O. Ward |
Proc. VLDB Endow. | 1 |