Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

To increase the relevancy of local patterns discovered from noisy relations, it makes sense to formalize error-tolerance. Our starting point is to address the limitations of state-of-the-art methods for this purpose. Some extractors perform an exhaustive search w.r.t. a declarative specification of error-tolerance. Nevertheless, their computational complexity prevents the discovery of large relevant patterns. Alpha is a 3-step method that (1) computes complete collections of closed patterns, possibly error-tolerant ones, from arbitrary n-ary relations, (2) enlarges them by hierarchical agglomeration, and (3) selects the relevant agglomerated patterns.

REFERENCES

• 1: S. Blachon, R. Pensa, J. Besson, C. Robardet, J.-F. Boulicaut, and O. Gandrillon. Clustering formal concepts to discover biologically relevant knowledge from gene expression data. In Silico Biology, 7(0033):1--15, July 2007.
• 2: L. Cerf, J. Besson, T. K. N. Nguyen, and J.-F. Boulicaut. An exhaustive search for error-tolerant patterns in arbitrary n-ary relations. Technical report, LIRIS, June 2009. Under evaluation.
• 3: Loïc Cerf , Jérémy Besson , Céline Robardet , Jean-François Boulicaut, Closed patterns meet n-ary relations, ACM Transactions on Knowledge Discovery from Data (TKDD), v.3 n.1, p.1-36, March 2009 [doi>10.1145/1497577.1497580]
• 4: Venkatesh Ganti , Johannes Gehrke , Raghu Ramakrishnan, CACTUS—clustering categorical data using summaries, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.73-83, August 15-18, 1999, San Diego, California, United States [doi>10.1145/312129.312201]
• 5: Rohit Gupta , Gang Fang , Blayne Field , Michael Steinbach , Vipin Kumar, Quantitative evaluation of approximate frequent pattern mining algorithms, Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2008, Las Vegas, Nevada, USA [doi>10.1145/1401890.1401930]
• 6: David J. Hand, Pattern Detection and Discovery, Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery, p.1-12, September 16-19, 2002
• 7: Jinze Liu , Susan Paulsen , Wei Wang , Andrew Nobel , Jan Prins, Mining Approximate Frequent Itemsets from Noisy Data, Proceedings of the Fifth IEEE International Conference on Data Mining, p.721-724, November 27-30, 2005 [doi>10.1109/ICDM.2005.93]
• 8: H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hätönen, and H. Mannila. Pruning and grouping discovered association rules. In Proc. of the ECML '95 Workshop on Statistics, Machine Learning and Knowledge Discovery in Databases, pages 47--52, 1995.
• 9: Andrew K. C. Wong , Gary C. L. Li, Simultaneous Pattern and Data Clustering for Pattern Cluster Analysis, IEEE Transactions on Knowledge and Data Engineering, v.20 n.7, p.911-923, July 2008 [doi>10.1109/TKDE.2008.38]
• 10: Mohammed J. Zaki , Markus Peters , Ira Assent , Thomas Seidl, Clicks: An effective algorithm for mining subspace clusters in categorical datasets, Data & Knowledge Engineering, v.60 n.1, p.51-70, January, 2007 [doi>10.1016/j.datak.2006.01.005]
• 11: Lizhuang Zhao , Mohammed J. Zaki, TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data, Proceedings of the 2005 ACM SIGMOD international conference on Management of data, June 14-16, 2005, Baltimore, Maryland [doi>10.1145/1066157.1066236]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.8 Database applications
          Subjects: Data mining

General Terms:
Algorithms

Keywords:
clustering, n-ary relation, noise, relevancy