H. D. K. Moonesinghe

According to our database, H. D. K. Moonesinghe authored at least 6 papers between 2002 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2008

Outrank: a Graph-Based Outlier Detection Framework Using Random Walk.

H. D. K. Moonesinghe, Pang-Ning Tan

Int. J. Artif. Intell. Tools, 2008

2007

A Probabilistic Substructure-Based Approach for Graph Classification.

H. D. K. Moonesinghe, Hamed Valizadegan, Samah Jamal Fodeh, Pang-Ning Tan

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

2006

Outlier Detection Using Random Walks.

H. D. K. Moonesinghe, Pang-Ning Tan

Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

Frequent Closed Itemset Mining Using Prefix Graphs with an Efficient Flow-Based Pruning Strategy.

H. D. K. Moonesinghe, Samah Jamal Fodeh, Pang-Ning Tan

Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006

2004

Parallel Implementation of WAP-Tree Mining Algorithm.

Ming Wu, Moon-Jung Chung, H. D. K. Moonesinghe

Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004

2002

Adaptively Increasing Performance and Scalability of Automatically Parallelized Programs.

Jaejin Lee, H. D. K. Moonesinghe

Proceedings of the Languages and Compilers for Parallel Computing, 15th Workshop, 2002