
 M. E. Houle.
Dimensionality, discriminability, density & distance distributions.
Proc. IEEE ICDM 2013 Workshop on High Dimensional Data Mining
(HDM 2013), Dallas, TX, USA, December 2013, to appear.
 M. E. Houle and M. Nett.
Rank cover trees for nearest neighbor search.
Proc. 6th International Conference on
Similarity Search and Applications
(SISAP 2013), A Coruña, Spain, October 2013, pp. 1629.
 M. E. Houle, X. Ma, M. Nett and V. Oria.
Dimensional testing for multistep similarity search.
Proc. 12th IEEE International Conference on Data Mining
(ICDM 2012), Brussels, Belgium, December 2012, pp. 209308.
 M. E. Houle, H. Kashima and M. Nett.
Generalized expansion dimension.
Proc. IEEE ICDM 2012 Workshop on Practical Theories
for Exploratory Data Mining
(PTDM 2012), Brussels, Belgium, December 2012, pp. 587594.
 M. E. Houle, H. Kashima and M. Nett.
Finding large elements in factorized tensors.
Proc. 12th Workshop on Algorithms for
LargeScale Information Processing
(ALSIP 2012), Miyazaki, Japan, NovemberDecember 2012.
 M. E. Houle, H. Kashima and M. Nett.
Fast similarity computation in factorized tensors.
Proc. 5th International Conference on
Similarity Search and Applications
(SISAP 2012), Toronto, Canada, August 2012, pp. 226239.
 J. Chan, J. Bailey, C. Leckie and M. E. Houle.
ciForager: Incrementally discovering regions of
correlated change in evolving graphs.
ACM Transactions on Knowledge Discovery from Data
6(3)i, pp. 11:111:50, October 2012.
 T. de Vries, S. Chawla and M. E. Houle.
Densitypreserving projections for largescale local anomaly detection.
Knowledge and Information Systems 32(1):2552, July 2012.
 Å. Västermark, A. Krishnan, M. E. Houle,
R. Fredriksson, J. M. CerdáReverter, H. B. Schiöth.
Identification of distant Agoutilike sequences and reevaluation
of the evolutionary history of the Agoutirelated peptide (AgRP).
PLoS ONE 7(7):e40982, July 2012.
 M. E. Houle, V. Oria, S. Satoh and J. Sun.
Knowledge propagation in large image databases using
neighborhood information.
Proc. ACM Multimedia
(ACM MM 2011), Scottsdale, AZ, USA, November 2011, pp. 10331036.
 M. E. Houle.
Combinatorial approaches to clustering and feature selection.
Proc. ECML/PKDD 2011 Workshop on Discovering, Summarizing and
Using Multiple Clusterings
(MultiClust 2011), Athens, Greece, September 2011, pp. 13
(invited presentation).
 T. Bernecker, M. E. Houle, H.P. Kriegel,
P. Kröger, M. Renz, E. Schubert and A. Zimek.
Quality of similarity rankings in time series.
Proc. 12th International Symposium on Spatial and
Temporal Databases
(SSTD 2011), Minneapolis, MN, USA, August 2011, pp. 422440.
 T. de Vries, S. Chawla and M. E. Houle.
Finding local anomalies in very high dimensional space.
Proc. 10th IEEE International Conference on Data Mining
(ICDM 2010), Sydney, Australia, December 2010, pp. 128137
(Best Research Paper Award).
 M. E. Houle, V. Oria and U. Qasim.
A partialorderbased active cache for recommender systems.
Proc. 19th ACM Conference on Information and Knowledge Management
(CIKM 2010), Toronto, Canada, October 2010, pp. 669678.
 S. Honiden, M. E. Houle, C. Sommer and M. Wolff.
Approximate shortest path queries in graphs using Voronoi duals.
Transactions on Computational Science, 9:3055, 2010.
(Special Issue on the Best Papers of ISVD 2009).
 M. E. Houle, H.P. Kriegel, P. Kröger,
E. Schubert and A. Zimek.
Can sharedneighbor distances defeat the curse of dimensionality?
In Proc. 22nd International Conference on Scientific and
Statistical Database Management (SSDBM 2010),
Heidelberg, Germany, June 2010, pp. 482500.
 N. X. Vinh and M. E. Houle.
A set correlation model for partitional clustering.
In Proc. 14th PacificAsia Conference on Knowledge
Discovery and Data Mining (PAKDD 2010),
Hyderabad, India, June 2010, pp. 415.
 U. Qasim, V. Oria,
B. Wu, T. M. Özsu, and M. E. Houle. A partialorderbased active cache
for recommender systems. In Proc. 3rd ACM Conference on Recommender
Systems (RecSys 2009), New York, NY, USA, October 2009,
pp. 209212.
 S. Honiden, M. E. Houle,
and C. Sommer. Balancing graph Voronoi diagrams. In Proc.
6th International Symposium on Voronoi Diagrams (ISVD 2009), Copenhagen,
Denmark, June 2009, pp. 183191.
 S. Honiden, M. E. Houle,
C. Sommer and M. Wolff. Approximate shortest path queries in graphs
using Voronoi duals. In Proc. 6th International Symposium on Voronoi
Diagrams (ISVD 2009), Copenhagen, Denmark, June 2009, pp. 5362.
 N. Hervé, N. Boujemaa
and M. E. Houle. Document description: what works for images should
also work for text? In Proc. 21st IS&T/SPIE Symposium on Electronic
Imaging, San Jose, CA, USA, January 2009, paper 725511.
 M. E. Houle. The relevantset correlation model for data clustering.
Statistical Analysis and Data Mining
1(3):157176, 2008 (Special Issue on the Best Papers of SDM’08).
 M. E. Houle. The relevantset correlation model for data clustering. In
Proc. 8th SIAM International
Conference on Data Mining (SDM 2008), Atlanta, GA, USA, April 2008,
pp. 775786.
 M. E. Houle and N.
Grira. A correlationbased model for unsupervised feature selection.
In Proc. 16th ACM Conference on Information and Knowledge Management
(CIKM 2007), Lisboa, Portugal, November 2007, pp. 897900.
 D.D. Le, S. Satoh
and M. E. Houle. Boosting face retrieval by using relevant set correlation
clustering. In Proc. 8th International Conference on Multimedia &
Expo (ICME 2007), Beijing, China, July 2007, pp. 524527.
 N. Grira and M.
E. Houle. Best of both: a hybridized centroidmedoid clustering
heuristic. In Proc. 24th International Conference on Machine Learning
(ICML 2007), Corvallis, OR, USA, June 2007, pp. 313320.
 D.D. Le, S. Satoh,
M. E. Houle and D. P. T. Nguyen. Finding important people in large news
video databases using multimodal and clustering analysis. In Proc.
2nd IEEE International Workshop on Multimedia Databases and Data Management
(IEEEMDDM 2007), Istanbul, Turkey, April 2007, pp. 127136.
 M. E. Houle. Clustering
without data: the relevant set correlation model. In Proc. International
Workshop on DataMining and Statistical Science (DMSS 2006), Sapporo,
Japan, September 2006, pp. 5461.
 M. E. Houle. Clustering
without data: the GreedyRSC heuristic. In Proc. International Workshop
on DataMining and Statistical Science (DMSS 2006), Sapporo, Japan,
September 2006, pp. 6269.
 D.D. Le, S. Satoh
and M. E. Houle. Face retrieval in broadcasting news video by fusing
temporal and intensity information. In Proc. 5th Conference on Image
and Video Retrieval (CIVR 2006), Tempe AZ, USA, July 2006, pp. 391400.
 M. E. Houle, F. Hurtado, M.
Noy and E. RiveraCampo. Graphs of triangulations and perfect
matchings. Graphs and Combinatorics 21(3):325331, 2005.
 M. E. Houle and J.
Sakuma. Fast approximate
similarity search in extremely highdimensional data sets. In Proc.
21st IEEE International Conference on Data Engineering (ICDE 2005),
Tokyo, Japan, Apr. 2005, pp. 619630.
 M. E. Houle, A. Symvonis
and D. R. Wood. Dimensionexchange algorithms for token distribution
on treeconnected architectures. J. Parallel and Distributed Computing
64(5):591605, 2004.
 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. 547552.
 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. 326333.
 C. Hernando, M. E. Houle
and F. Hurtado. On local transformation of polygons with visibility
properties. Theoretical Computer Science 289(2):919937, 2002.
 V. EstivillCastro and M. E. Houle.
"Approximating Proximity for Fast and Robust DistanceBased Clustering"
in Data Mining: A Heuristic Approach Vol. I, H. A. Abbass, R.
Sarkar and C. Newton, eds., Idea Group Publishing, Hershey, PA, pp.
2246, 2002. (ISBN 1930708254.)
 M. E. Houle, A. Symvonis
and D. R. Wood. Dimensionexchange 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. 181196.
 P. Bose, M. E. Houle,
G. Toussaint. Every set of disjoint line segments admits a binary tree.
Discrete & Computational Geometry
26(3):387410, 2001.
 V. EstivillCastro
and M. E. Houle. Robust distancebased clustering with applications
to spatial data mining. Algorithmica 30(2):216242, 2001. (special
issue on algorithms for geographical information)
 C. Friedrich and M.
E. Houle. Graph drawing in motion II. In Lecture Notes in Comp. Sci.
2265 (Proc. 9th Symposium on Graph Drawing (GD 2001), Vienna,
Austria), SpringerVerlag, 2001, pp. 220231.
 V. EstivillCastro
and M. E. Houle. Data structures for minimization of total withingroup
distance for spatiotemporal clustering. In Lecture Notes in Artificial
Intelligence 2168 (Proc. 5th European Conference on Principles and
Practice of Knowledge Discovery in Databases (PKDD’01), Freiburg,
Germany) SpringerVerlag, 2001, pp. 91102.
 K. Pulo and M. E.
Houle. Evaluation of virtual world systems. In Proc. 13th Australian
Software Engineering Conference (ASWEC 2001), Canberra, Australia,
Aug. 2001, IEEE Computer Society, pp. 98107.
 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, 2001, pp. 391400.
 V. EstivillCastro
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 SpatioTemporal Data
Mining (TSDM 2000), Lyon, France), SpringerVerlag, 2000, pp. 7788.
 C. Hernando, M. E. Houle
and F. Hurtado. On local transformation of polygons with visibility
properties. In Lecture Notes in Comp. Sci. 1858 (Proc. 6th
Annual International Computing and Combinatorics Conference (COCOON’00),
Sydney, Australia), SpringerVerlag, 2000, pp. 5463.
 M. E. Houle, E. Tempero,
and G. Turner. Optimal dimensionexchange token distribution
on complete binary trees. Theoretical Computer Science 220:363376,
1999.
 B. K. Bhattacharya
and M. E. Houle. Generalized maximum independent sets for trees in subquadratic
time. In Lecture Notes in Comp. Sci.
1741 (Proc. 10th International Symposium on Algorithms and Computation
(ISAAC’99), Chennai, India), SpringerVerlag, 1999, pp. 435445.
 V. EstivillCastro
and M. E. Houle. Robust clustering of large georeferenced data
sets. In Lecture Notes in Comp. Sci.
1574 (Proc. 3rd PacificAsia Conference on Knowledge Discovery and
Data Mining (PAKDD’99), Beijing), SpringerVerlag, 1999, pp. 327337.
 V. EstivillCastro
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), SpringerVerlag, 1999, pp. 165176.
 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):116,
1998.
 M. E. Houle and
G. Turner. Dimensionexchange token distribution on the mesh and
the torus. Parallel Computing 24(2):247265, 1998.
 M. E. Houle and R. Webber.
Approximation algorithms for finding best viewpoints. In Lecture
Notes in Comp. Sci. 1547 (Proc. 6th Symposium on Graph Drawing
(GD 1998), Montreal, Canada), SpringerVerlag, 1998, pp. 210223.
 S. Fekete, M. E. Houle
and S. Whitesides. The wobbly logic engine: proving hardness of nonrigid
geometric graph representation problems. In Lecture Notes in Comp.
Sci. 1353 (Proc. 5th Symposium on Graph Drawing (GD 1997),
Rome, Italy), SpringerVerlag, 1998, pp. 272283.
 P. Eades, M. E. Houle and
R. Webber. Finding best viewpoints for threedimensional graph drawings.
In Lecture Notes in Comp. Sci. 1353 (Proc. 5th Symposium on
Graph Drawing (GD 1997), Rome, Italy), SpringerVerlag, 1998, pp.
8798.
 M. E. Houle and Simon.
Social and ethical education in computing using virtual environments.
In Proc. 2nd Australasian Comput. Sci. Educ. Conf., Melbourne,
Australia, July 1997, pp. 2431.
 M. E. Houle and Simon.
Ethics, programming, and virtual environments. In Proc. ACM SIGCSE/CUE
Conf. Integrating Technology into Comput. Sci. Educ., Uppsala, Sweden,
June 1997, pp. 9193.
 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. 1725.
 M. E. Houle and
G. Turner. Dimensionexchange token distribution on the mesh and
the torus. In Lecture Notes in Comp. Sci.
1178 (Proc. 7th International Symposium on Algorithms and Computation
(ISAAC’96), Osaka, Japan), SpringerVerlag, 1996, pp. 233232.
 M. E. Houle. On local
transformations of simple polygons. Australian Computer Science Communications
18(3), (Proceedings of Computing: the Australasian Theory Symposium
(CATS’96), Melbourne, Australia), Jan. 1996, pp. 6471.
 D. Avis and M. E. Houle.
Computational aspects of Helly’s theorem and its relatives. International
Journal of Computational Geom. & Appl. 5(4):357367, 1995.
 S. P. Fekete, M. E. Houle,
S. Whitesides. New results on a visibility representation of graphs
in 3D. In Lecture Notes in Comp. Sci. 1027 (Proc. 3rd Symposium
on Graph Drawing (GD 1995), Passau, Germany), SpringerVerlag, 1995,
pp. 234241.
 P. Bose, M. E.
Houle, G. Toussaint. Every set of disjoint line segments admits
a binary tree. In Lecture Notes in Comp. Sci. 834 (Proc.
5th International Symposium on Algorithms and Computation (ISAAC’94),
Beijing, P. R. China), SpringerVerlag, 1994, pp. 2028.
 G.H. Chen, M. E. Houle and
M.T. Kuo. The Steiner problem in distributed computing systems.
Information Sciences 74(1):7396, 1993.
 M. E. Houle. Algorithms
for weak and wide separation of sets. Discrete Appl. Math. 45(2):139159,
1993.
 M. E. Houle, H. Imai,
K. Imai, J.M. Robert and P. Yamamoto. Orthogonal weighted linear L_{1}
and L_{∞} approximation and applications. Discrete Appl.
Math. 43(3):217232, 1993.
 H. ElGindy, M. E.
Houle, W. Lenhart, M. Miller, D. Rappaport and S. Whitesides. Dominance
drawings of bipartite graphs. In Proc. 5th Canadian Conf. on Comput.
Geom., Waterloo, Canada, Aug. 1993, pp. 187191.
 M. E. Houle. Theorems
on the existence of separating surfaces. Discrete & Computational
Geometry 6(1):4956, 1991.
 D. Avis and M. E. Houle.
Computational aspects of Helly’s theorem and its relatives. In
Proc. 3rd Canadian Conf. on Comput. Geom., Vancouver, Canada, Aug.
1991, pp. 1114.
 Te. Asano, M. E. Houle,
H. Imai, and K. Imai. Linearspace solutions to hashingrelated geometric
minimax problems. In Proc. 2nd Canadian Conf. on Comput. Geom.,
Ottawa, Canada, Aug. 1990, pp. 2023.
 M. E. Houle. Algorithms
for weak and wide separation of sets. In Proc. International Workshop
on Disc. Alg. and Complexity, Fukuoka, Japan, Nov. 1989, pp. 6168.
 M. E. Houle and G.
T. Toussaint. Computing the width of a set. IEEE Trans. Patt. Anal.
Mach. Intell. 10(5):761765, 1988.
 M. E. Houle, H. Imai,
K. Imai and J.M. Robert. Weighted orthogonal linear L_{∞}approximation
and applications. In Lecture Notes in Comp. Sci. 382 (Proc.
1989 Workshop on Algorithms and Data Structures,
Carleton Univ., Ottawa, Canada), SpringerVerlag, 1989, pp. 183191.
 M. E. Houle and G.
T. Toussaint. Computing the width of a set. In Proc. 1st ACM Symposium
on Computational Geometry (SoCG 1985), Baltimore, MD, USA, 1985,
pp. 17.
