Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
ODAM: An optimized distributed association rule mining algorithm
This work has developed a distributed algorithm, called optimized distributed association mining, for geographically distributed data sets, called ODAM, which generates support counts of candidate itemsets quicker than the other DARM algorithms and reduces the size of average transactions, data set, and message exchanges.
k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation
An extensive experimental investigation in main memory revisits a previously discarded technique (IER) showing that, through a simple improvement, it is often the best performing technique.
High Performance Parallel Database Processing and Grid Databases
This book targets the theoretical/conceptual details needed to form a base of understanding and then delivers information on development, implementations, and analytical modeling of parallel…
Computational Science and its Applications
Domain-Driven, Actionable Knowledge Discovery
Data mining increasingly faces complex challenges in the real-life world of business problems and needs and both researchers and practitioners are realizing the importance of domain knowledge to close this gap and develop actionable knowledge for real user needs.
A distributed approach to sub-ontology extraction
- M. Bhatt, Andrew Flahive, C. Wouters, J. Rahayu, D. Taniar, T. Dillon
- Computer Science18th International Conference on Advanced…
- 29 March 2004
This paper proposes an approach for distributed ontology extraction where each user may extract optimized sub-ontologies from an existing base ontology, knowing that this approach will play an important role in improving the efficiency of information retrieval.
Semantic Completeness in Sub-ontology Extraction Using Distributed Methods
A distributed memory architecture serves two purposes: Facilitates the utilization of a cluster environment typical in business organizations, which is in line with the envisaged application of the proposed system and enhances the performance of the computationally extensive extraction process when dealing with massively sized realistic ontologies.
Aggregate-join query processing in parallel database systems
- D. Taniar, Y. Jiang, K. H. Liu, C. Leung
- Computer ScienceProceedings Fourth International Conference…
- 14 May 2000
Three parallel aggregate-join query processing methods are discussed, namely: Join Partition Method (JPM), Aggregate Partitions Method (APM), and Hybrid Partition method (HPM), which use the join attribute and the group-by attribute, respectively, as the partitioning attribute.
Trustworthy-based efficient data broadcast model for P2P interaction in resource-constrained wireless environments
Continuous Range Search Query Processing in Mobile Navigation
- Kefeng Xuan, Geng Zhao, D. Taniar, B. Srinivasan
- Computer Science14th IEEE International Conference on Parallel…
- 8 December 2008
This paper proposes two new methods to process continuous range search query in mobile computing, one is constructed using R-tree index based on Euclidean distance, and the other addresses the requirement on actual network distance.