VLDB 2026 Research / reviewers in the wild / expert
Ying-Hsiang Wen
dblp:52/1822
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware accelerators and domain-specific architectures · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › pattern mining
apriori algorithm |
0.0 | 1 | 2008 | Hardware-Enhanced Association Rule Mining with Hashing and Pipelining · IEEE Trans. Knowl. Data Eng. 2008 |
Data mining › pattern mining
association rule mining |
0.0 | 1 | 2008 | Hardware-Enhanced Association Rule Mining with Hashing and Pipelining · IEEE Trans. Knowl. Data Eng. 2008 |
Methods — techniques the papers use, named apart from their topics
pipelining · 0.2hashing · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Hardware-Enhanced Association Rule Mining with Hashing and PipeliningabstractGenerally speaking, to implement Apriori-based association rule mining in hardware, one has to load candidate itemsets and a database into the hardware. Since the capacity of the hardware architecture is fixed, if the number of candidate itemsets or the number of items in the database is larger than the hardware capacity, the items are loaded into the hardware separately. The time complexity of those steps that need to load candidate itemsets or database items into the hardware is in proportion to the number of candidate itemsets multiplied by the number of items in the database. Too many candidate itemsets and a large database would create a performance bottleneck. In this paper, we propose a HAsh-based and Pipelined (abbreviated as HAPPI) architecture for hardware- enhanced association rule mining. We apply the pipeline methodology in the HAPPI architecture to compare itemsets with the database and collect useful information for reducing the number of candidate itemsets and items in the database simultaneously. When the database is fed into the hardware, candidate itemsets are compared with the items in the database to find frequent itemsets. At the same time, trimming information is collected from each transaction. In addition, itemsets are generated from transactions and hashed into a hash table. The useful trimming information and the hash table enable us to reduce the number of items in the database and the number of candidate itemsets. Therefore, we can effectively reduce the frequency of loading the database into the hardware. As such, HAPPI solves the bottleneck problem in a priori-based hardware schemes. We also derive some properties to investigate the performance of this hardware implementation. As shown by the experiment results, HAPPI significantly outperforms the previous hardware approach and the software algorithm in terms of execution time. Ying-Hsiang Wen, Jen-Wei Huang, Ming-Syan Chen |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2006 | User-Assisted Image Classification on Personal Photo CollectionsabstractImage classification on personal photo collections can be extremely useful to various management tasks. However, there is little progress made forwarding it due to (1) lack of training data, and (2) subjectivity inherent in a user's photo-organizing behavior. In this paper, we propose a framework, user-assisted image classification on personal photo collections (UCP), to address this problem. The uniqueness of this framework is that it is user-centric and includes users in the loop. Our experimental results show that the techniques used in this framework are promising Wei-Ta Chen, Ying-Hsiang Wen, Ming-Syan Chen |
ICME | 2 |