The Community for Technology Leaders
2013 IEEE 13th International Conference on Data Mining (2006)
Hong Kong
Dec. 18, 2006 to Dec. 22, 2006
ISSN: 1550-4786
ISBN: 0-7695-2701-9
pp: 510-521
Philip S. Yu , IBM T.J. Watson Research Center, USA
Deepak Rajan , IBM T.J. Watson Research Center, USA
ABSTRACT
We approach the problem of discovering interesting orders in data. In many applications, it is more important to find interesting partial orders since there is often no clear ordering between certain sets of elements. Furthermore, a partial order is more robust against partially erroneous data. We present the notion of fundamental partial orders (FPO), and argue that any partial order that satisfies this property is an interesting partial order. To mine such partial orders, we present a two-stage methodology that first finds an interesting total order, and then discovers a partial order satisfying FPO using this total order. To illustrate, we focus on {0, 1} data. This is an important problem with many applications, e.g., in paleontology, where we chronologically order fossil sites by minimizing Lazarus counts. We present the experimental results of our method on paleontological data, and show that it outperforms existing approaches. The techniques developed here are general and can be abstracted for mining partial orders in any setting.
INDEX TERMS
null
CITATION
Philip S. Yu, Deepak Rajan, "Discovering Partial Orders in Binary Data", 2013 IEEE 13th International Conference on Data Mining, vol. 00, no. , pp. 510-521, 2006, doi:10.1109/ICDM.2006.57
92 ms
(Ver )