Introduction of researcher

As of  2004.05.18      

 

[Name] 

HOULE, Michael E.

[Date of birth] 

1962/07/20

[Doctoral degrees] 

PhD McGill University (Canada) 1989

[Affiliation] 

Visiting Professor, Data Collection Laboratory,

Research Center for Information Resources

[Room] 

1403

[Telephone] 

+81-3-4212-2538

[Facsimile] 

+81-3-3556-1916

[E-mail] 

meh@nii.ac.jp

[Personal home page] 

http://research.nii.ac.jp/~meh/

[Research fields] 

Data mining (search, clustering, classification), design and analysis of algorithms, visualization, combinatorial geometry

 

 

 

 

<> 

Outline of current research

 

<> 

Education

 

<> 

Career

 

<> 

Refereed publications, published books

 

<> 

Patents / softwares / other works

 

 

 

 

 

 

 

 

[Outline of current research] 

 

Design and analysis of data structures for approximate similarity search in extremely high-dimensional settings.

Local clustering models and techniques for data mining applications (such as data summarization & navigation).

 

[Education] 

 

PhD in Computer Science (computational geometry), McGill University, 1989

BSc (Honours) in Mathematics and Computer Science, McGill University, 1984

 

[Career] 

 

1989-1990  Research Associate, Dept of Communication Engineering, Kyushu University

1990-1992  Research Associate, Dept of Information Science, University of Tokyo

1992-1997  Lecturer, Dept of Computer Science & Software Engineering, University of Newcastle (Australia)

1997-1999  Senior Lecturer

1999-2001  Senior Lecturer, Dept of Computer Science, University of Sydney (Australia)

2001-2003  Visiting Scientist at IBM Tokyo Research Laboratory

2004-  Visiting Professor at the National Institute for Informatics

 

[Refereed publications, published books] 

 
  1. M. E. Houle, A. Symvonis and D. R. Wood. Token distribution on tree-connected architectures. J. Parallel and Distributed Computing, to appear 2004.
  2. M. E. Houle. Navigating massive data sets via local clustering. In Proc. 9th ACM SIGKDD Conf. on Knowledge Discovery and Data Mining (KDD), Washington DC, USA, Aug. 2003, pp. 547-552.
  3. Y. Morimoto, M. Aono, M. E. Houle and K. S. McCurley. Extracting spatial knowledge from the web. In Proc. 2003 International Symposium on Applications and the Internet (SAINT 2003), Orlando, USA, Jan. 2003, pp. 326-333.
  4. M. E. Houle, A. Symvonis and D. R. Wood. Dimension-exchange algorithms for load balancing on trees. In Proc. 9th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2002), Andros, Greece, June 2002, Carleton Scientific, pp. 181-196.
  5. V. Estivill-Castro and M. E. Houle. “Approximating Proximity for Fast and Robust Distance-Based Clustering”, in Data Mining: A Heuristic Approach Vol. I (H. A. Abbass, R. Sarkar and C. Newton, eds.). Idea Group Publishing, Hershey, PA, pp. 22-46, 2002.
  6. C. Hernando, M. E. Houle and F. Hurtado. On local transformation of polygons with visibility properties. Theoretical Computer Science 289(2):919-937, 2002.
  7. P. Bose, M. E. Houle, G. Toussaint. Every set of disjoint line segments admits a binary tree. Discrete & Computational Geometry 26(3):387-410, 2001.
  8. V. Estivill-Castro and M. E. Houle. Robust distance-based clustering with applications to spatial data mining. Algorithmica 30(2):216--242, 2001.
  9. C. Friedrich and M. E. Houle. Graph drawing in motion II. In Lecture Notes in Computer Science 2265 (Proc. 9th Symposium on Graph Drawing (GD 2001), Vienna, Austria), Springer-Verlag, 2001, pp. 220-231.
  10. V. Estivill-Castro and M. E. Houle. Data structures for minimization of total within-group distance for spatio-temporal clustering. In Lecture Notes in Artificial Intelligence 2168 (5th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'01), Freiburg, Germany) Springer-Verlag, 2001, pp. 91-102.
  11. T. Menzies, J. Powell and M. E. Houle. Fast formal analysis of requirements via topoi diagrams. In {Proc. 23rd International Conference on Software Engineering (ICSE 2001), Toronto, Canada, pp. 391-400.
  12. K. Pulo and M. E. Houle. Evaluation of virtual world systems. In Proc. 13th Australian Conference on Software Engineering (ASWEC 2001), Canberra, Australia, 2001, pp. 98-107.
  13. V. Estivill-Castro and M. E. Houle. Fast randomized algorithms for robust estimation of location. In Lecture Notes in Artificial Intelligence 2007 (Proc. International Workshop on Temporal, Spatial and Spatio-Temporal Data Mining (TSDM 2000), Lyon, France), Springer-Verlag, 2000, pp. 77-88.
  14. C. Hernando, M. E. Houle and F. Hurtado. On local transformation of polygons with visibility properties. In Lecture Notes in Computer Science 1858 (Proc. 6th Annual International Computing and Combinatorics Conference (COCOON'00), Sydney, Australia), Springer-Verlag, 2000, pp. 54-63.
  15. M. E. Houle, E. Tempero, and G. Turner. Optimal dimension-exchange token distribution on complete binary trees. Theoretical Computer Science 220:363-376, 1999.
  16. B. K. Bhattacharya and M. E. Houle. Generalized maximum independent sets for trees in subquadratic time. In Lecture Notes in Computer Science 1741 (Proc. 10th International Symposium on Algorithms and Computation (ISAAC'99), Chennai, India), Springer-Verlag, 1999, pp. 435-445.
  17. V. Estivill-Castro and M. E. Houle. Robust clustering of large geo-referenced data sets. In Lecture Notes in Computer Science 1574 (Proc. 3rd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'99), Beijing), Springer-Verlag, 1999, pp. 327-337.
  18. V. Estivill-Castro and M. E. Houle. Robust clustering of large data sets with categorical attributes. In Australian Computer Science Communications 21(2) (Proc. 10th Australasian Database Conference (ADC'99), Auckland, New Zealand), Springer-Verlag, 1999, pp. 165-176.
  19. M. E. Houle and R. Webber. Approximation algorithms for finding best viewpoints. In Lecture Notes in Computer Science 1547 (Proc. 6th Symposium on Graph Drawing (GD 1998), Montreal, Canada), Springer-Verlag, 1998, pp. 210-223.
  20. P. Bose, H. Everett, S. Fekete, M. E. Houle, A. Lubiw, H. Meijer, K. Romanik, G. Rote, T. C. Shermer, S. Whitesides and C. Zelle. A visibility representation for graphs in three dimensions. J. Graph Algorithms and Applications 2(3):1-16, 1998.
  21. M. E. Houle and G. Turner. Dimension-exchange token distribution on the mesh and the torus. Parallel Computing 24(2):247-265, 1998.
  22. P. Eades, M. E. Houle and R. Webber. Finding best viewpoints for three-dimensional graph drawings. In Lecture Notes in Computer Science 1353 (Proc. 5th Symposium on Graph Drawing (GD 1997), Rome, Italy), Springer-Verlag, 1998, pp. 87-98.
  23. S. Fekete, M. E. Houle and S. Whitesides. The wobbly logic engine: proving hardness of non-rigid geometric graph representation problems. In Lecture Notes in Computer Science1353 (Proc. 5th Symposium on Graph Drawing (GD 1997), Rome, Italy), Springer-Verlag, 1998, pp. 272-283.
  24. M. E. Houle and Simon. Social and ethical education in computing using virtual environments. In Proc. 2nd Australasian Computer Science Education Conference, Melbourne, Australia, July 1997, pp. 24-31.
  25. M. E. Houle and Simon. Ethics, programming, and virtual environments. In Proc. ACM SIGCSE/CUE Conf. on Integrating Technology into Computer Science Education, Uppsala, Sweden, June 1997, pp. 91-93.
  26. B. K. Bhattacharya and M. E. Houle. Generalized maximum independent sets for trees. In Proc. Computing: the Australasian Theory Symposium (CATS'97), Sydney, Australia, Feb. 1997, pp. 17-25.
  27. M. E. Houle and G. Turner. Dimension-exchange token distribution on the mesh and the torus. In Lecture Notes in Computer Science 1178 (Proc. 7th International Symposium on Algorithms and Computation (ISAAC'96), Osaka, Japan), Springer-Verlag, 1996, pp. 233-232.
  28. M. E. Houle. On local transformations of simple polygons. Australian Computer Science Communications 18(3), (Proc. Computing: the Australasian Theory Symposium (CATS'96), Melbourne, Australia), Jan. 1996, pp. 64-71.
  29. S. P. Fekete, M. E. Houle, S. Whitesides. New results on a visibility representation of graphs in 3D. In Lecture Notes in Computer Science 1027 (Proc. 3rd Symposium on Graph Drawing (GD 1995), Passau, Germany), Springer-Verlag, 1995, pp. 234-241.
  30. D. Avis and M. E. Houle. Computational aspects of Helly's theorem and its relatives. International Journal of Computational Geometry & Applications 5(4):357-367, 1995.
  31. P. Bose, M. E. Houle, G. Toussaint. Every set of disjoint line segments admits a binary tree. In Lecture Notes in Computer Science 834 (Proc. 5th International Symposium on Algorithms and Computation (ISAAC'94), Beijing, China), Springer-Verlag, 1994, pp. 20-28.
  32. H. ElGindy, M. E. Houle, W. Lenhart, M. Miller, D. Rappaport and S. Whitesides. Dominance drawings of bipartite graphs. In Proc. 5th Canadian Conference on Computational Geometry, Waterloo, Canada, Aug. 1993, pp. 187-191.
  33. G.-H. Chen, M. E. Houle and M.-T. Kuo. The Steiner problem in distributed computing systems. Information Sciences 74(1):73-96, 1993.
  34. M. E. Houle. Algorithms for weak and wide separation of sets. Discrete Applied Mathematics 45(2):139-159, 1993.
  35. M. E. Houle, H. Imai, K. Imai, J.-M. Robert and P. Yamamoto. Orthogonal weighted linear L1 and L∞ approximation and applications. Discrete Applied Mathematics 43(3):217-232, 1993.
  36. M. E. Houle. Theorems on the existence of separating surfaces. Discrete & Computational Geometry 6(1):49-56, 1991.
  37. D. Avis and M. E. Houle. Computational aspects of Helly's theorem and its relatives. In Proc. 3rd Canadian Conference on Computational Geometry, Vancouver, Canada, Aug. 1991, pp. 11-14. 
  38. Te. Asano, M. E. Houle, H. Imai, and K. Imai. Linear-space solutions to hashing-related geometric minimax problems. In Proc. 2nd Canadian Conference on Computational Geometry, Ottawa, Canada, Aug. 1990, pp. 20-23.
  39. M. E. Houle. Algorithms for weak and wide separation of sets. In Proc. International Workshop on Discrete Algorithms and Complexity, Fukuoka, Japan, Nov. 1989, pp. 61-68.
  40. M. E. Houle, H. Imai, K. Imai and J.-M. Robert. Weighted orthogonal linear L∞-approximation and applications. In Lecture Notes in Computer Science 382 (Proc. 1989 Workshop on Algorithms and Data Structures, Ottawa, Canada), Springer-Verlag, 1989, pp. 183-191.
  41. M. E. Houle and G. T. Toussaint. Computing the width of a set. IEEE Trans. Pattern Analysis and Machine Intelligence 10(5):761-765, 1988.

[Patents / softwares / other works] 

 

5 patent applications pending.