OBJECTMINER: A NEW APPROACH FOR MINING COMPLEX OBJECTS

Roxana Danger, José Ruíz-Shulcloper, Rafael Berlanga

Abstract

Since their introduction in 1993, association rules have been successfully applied to the description and summarization of discovered relations between attributes in a large collection of objects. However, most of the research works in this area have focused on mining simple objects, usually represented as a set of binary variables. The proposed work presents a framework for mining complex objects, whose attributes can be of any data type (single and multi-valued). The mining process is guided by the semantics associated to each object feature, which is stated by users by providing both a comparison criterion and a similarity function over the object subdescriptions. Experimental results show the usefulness of the proposal.

References

  1. Agrawal, R.; Imielinski, T.; Swami, A., 1993. Mining Association Rules between Sets of items in Large DataBases. In Proceeding of ACM SIGMOD.
  2. Agrawal, R.; Srikant, R, 1994. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases, pages 487-499.
  3. Danger, R.; Berlanga, R., Ruíz-Shulcloper, J., 2003. Text Mining using the hierarchical syntactical structure of Documents. In Proceeding of the 10th CAEPIA, pages 139-148.
  4. Gyenesei, A., 2000. Mining Weighted Association Rules for Fuzzy Quantitative Items. In Proceedings of PKDD Conference, pages 416-423.
  5. Han, J.; Nishio, S.; Kawano, H.; Wang, W., 1998. Generalization-based data minimg in object oriented databases using an object Cube Model. Data and knowledge engineering, pages 55-97.
  6. Hipp, J: Myka A.; Wirth R.; Günttzer U., 1998. A new Algorithm for faster mining of Generalized Association Rules. In Principles of Data Mining and Knowledge Discovery.
  7. Miller, R.J. and Yang, Y., 1997. Association rules over interval data. In Proceedings of ACM-SIGMOD, pages 452-461.
  8. Savasare, A.; Omiecinski, E.; Navathe, S., 1995: An efficient Algorithm for Mining Association Rules in Large Databases. Technical Report No. GIT-cc-95-04. College of Computing. Georgia' Institute of Technology.
  9. Srikant, R. Agrawal, R, 1995. Mining Generalized Association Rules, In Proceedings of Very Large Databases.
  10. Srikant, R., Agrawal, R.:, 1996. Mining quantitative association rules in large relational tables. In Proceedings of ACM SIGMOD.
  11. Zhang, Z., Lu, Y. Zhang, B., 1997:.An effective Partitioning-Combining Algorithm for Discovering Quantitative Association Rules. In Proceedings of the First Pacific-Asia Conference on Knowledge Discovery and Data Mining.
Download


Paper Citation


in Harvard Style

Danger R., Ruíz-Shulcloper J. and Berlanga R. (2004). OBJECTMINER: A NEW APPROACH FOR MINING COMPLEX OBJECTS . In Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 972-8865-00-7, pages 42-47. DOI: 10.5220/0002633500420047


in Bibtex Style

@conference{iceis04,
author={Roxana Danger and José Ruíz-Shulcloper and Rafael Berlanga},
title={OBJECTMINER: A NEW APPROACH FOR MINING COMPLEX OBJECTS},
booktitle={Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2004},
pages={42-47},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002633500420047},
isbn={972-8865-00-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - OBJECTMINER: A NEW APPROACH FOR MINING COMPLEX OBJECTS
SN - 972-8865-00-7
AU - Danger R.
AU - Ruíz-Shulcloper J.
AU - Berlanga R.
PY - 2004
SP - 42
EP - 47
DO - 10.5220/0002633500420047