• Publications
  • Influence
Mining fuzzy association rules in databases
TLDR
In this paper, we introduce the fuzzy association rules of the form, 'If X is A then Y is B', to deal with quantitative attributes. Expand
  • 529
  • 22
Fast time-series searching with scaling and shifting
TLDR
In this paper, we first propose a definition of similarity based on scaling and shifting transformations. Expand
  • 187
  • 11
  • PDF
iview: an interactive WebGL visualizer for protein-ligand complex
TLDR
We have developed iview, an easy-to-use interactive WebGL visualizer of protein-ligand complex. Expand
  • 58
  • 4
A Precise Termination Condition of the Probabilistic Packet Marking Algorithm
TLDR
The probabilistic packet marking (PPM) algorithm is a promising way to discover the Internet map or an attack graph that the attack packets traversed during a distributed denial-of-service attack is correct, with a specified level of confidence. Expand
  • 20
  • 4
  • PDF
Substituting random forest for multiple linear regression improves binding affinity prediction of scoring functions: Cyscore as a case study
TLDR
We investigate the conditions of applying RF under various contexts and find that given sufficient training samples RF manages to comprehensively capture the non-linearity between structural features and measured binding affinities. Expand
  • 49
  • 3
  • PDF
Finding Fuzzy Sets for the Mining of Fuzzy Association Rules for Numerical Attributes
Fuzzy association rules is introduced in 3]. However, the algorithms proposed by 3] for mining fuzzy association rules assumes that fuzzy sets are given. Here we propose a method to nd the fuzzy setsExpand
  • 64
  • 3
idock: A multithreaded virtual screening tool for flexible ligand docking
TLDR
We developed idock, inheriting from AutoDock Vina the accurate scoring function and the efficient optimization algorithm, and significantly improving the fundamental implementation and numerical model for even faster execution. Expand
  • 53
  • 2
Efficient subsequence matching for sequences databases under time warping
  • T. Wong, M. H. Wong
  • Computer Science
  • Seventh International Database Engineering and…
  • 16 July 2003
TLDR
We present a method that supports dynamic time warping for subsequence matching within a collection of sequences. Expand
  • 32
  • 2
Tolerating bounded inconsistency for increasing concurrency in database systems
TLDR
Bounded inconsistency can be applied to many areas which do not require exact values of the data such as for gathering information for statistical purpose, for making high level decisions and reasoning in expert systems. Expand
  • 38
  • 2
Predicting Approximate Protein-DNA Binding Cores Using Association Rule Mining
TLDR
We formalize the problem of mining approximate association rules from sequence data and propose a novel efficient algorithm to predict protein-DNA binding cores. Expand
  • 14
  • 2