{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T06:22:32Z","timestamp":1673677352581},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2005,7,19]],"date-time":"2005-07-19T00:00:00Z","timestamp":1121731200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s00500-005-0506-8","type":"journal-article","created":{"date-parts":[[2005,7,19]],"date-time":"2005-07-19T12:54:15Z","timestamp":1121777655000},"page":"453-460","source":"Crossref","is-referenced-by-count":3,"title":["Discovering R-rules with a directed hierarchy"],"prefix":"10.1007","volume":"10","author":[{"given":"R.","family":"Gras","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Kuntz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,19]]},"reference":[{"key":"506_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinsky T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceeding of the ACM SIGMOD'93, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"506_CR2","unstructured":"Bailleul M (2001) Implicative networks for highlighting representations (in french). Math\u00e9matiques et Sciences Humaines, 154:31\u201346"},{"key":"506_CR3","unstructured":"Benz\u00e9cri JP (1973) L'analyse des donn\u00e9es (vol. 1): Taxonomie. Dunod, Paris"},{"key":"506_CR4","doi-asserted-by":"crossref","unstructured":"Blanchard J, Kuntz P, Guillet G, Gras R (2003) Implication intensity: from the basic definition to the entropic version \u2013 chapter 28. In: Chapman et al. (ed) Statistical data mining and knowledge discovery. CRC Press, Boca Raton, pp 475\u2013493","DOI":"10.1201\/9780203497159.ch28"},{"key":"506_CR5","unstructured":"Buntine W (1996) Graphical models for knowledge discovery. In: Fayyad UM, Piatetsky-Shapiro G, Smyth P (eds) Advances in knowledge discovery and data mining, pp 59\u201382"},{"key":"506_CR6","unstructured":"Gordon AD(1999) Classification. Chapman and Hall CRC, Londen\/Boca Raton"},{"key":"506_CR7","unstructured":"Gras R (1996) L'implication statistique - Nouvelle m\u00e9thode exploratoire de donn\u00e9es. La Pensee Sauvage editions, France"},{"key":"506_CR8","doi-asserted-by":"crossref","unstructured":"Gras R, Briand H, Peter P (1996) Structuration sets with implication intensity. In: Proceedings of the international conference on ordinal and symbolic data analysis Springer, Berlin Heidelberg New York, pp 147\u2013156","DOI":"10.1007\/978-3-642-61159-9_13"},{"key":"506_CR9","unstructured":"Gras R, Kuntz P, Briand H (2001) The foundations of the implicative statistical analysis and some extensions for data mining (in french). Math\u00e9matiques et Sciences Humaines 154:9\u201329"},{"key":"506_CR10","unstructured":"Greenacre JM (1984) Theory and applications of correspondence analysis. Academic, New York"},{"key":"506_CR11","unstructured":"Hilderman RJ, Hamilton HJ (2000) Heuristics measures of interestingness. In: Proceedings of the 4th European conference of principles of data mining and knowledge discovery, L.N.A.I. 1910, pp 232\u2013241"},{"key":"506_CR12","unstructured":"Horschka P, Kl\u00f6sgen W (1991) A support system for interpreting statistical data. In: Piatetsky-Shapiro G, Frawley W-J (eds), Knowledge discovery in databases, pp 325\u2013345. AAAI Press, Menlo Park"},{"key":"506_CR13","doi-asserted-by":"crossref","unstructured":"Johnson SC (1967) Hierarchical clustering scheme. Psychometrika 32:241\u2013254","DOI":"10.1007\/BF02289588"},{"key":"506_CR14","unstructured":"Klementtinen M, Mannila H, Ronkainen P, Toivonen H, Verkamo AI (1994) Finding interesting rules from large sets of discovered association rules. In: Proceedings of the 3rd international conference on information and knowledge management. ACM, New York, pp 401\u2013407"},{"key":"506_CR15","doi-asserted-by":"crossref","unstructured":"Kuntz P, Lehn R, Guillet F, Briand H (2000) A user-driven process for mining association rules. In: Proceedings of principles of data mining and knowledge discovery, Springer, Berlin Heidelberg New York, pp 483\u2013489","DOI":"10.1007\/3-540-45372-5_55"},{"key":"506_CR16","doi-asserted-by":"crossref","unstructured":"Lent B, Swami AN, Widom J (1997) Clustering association rules. In: Proceedings of the 13th international conference on data engineering. IEEE Computer Society, pp 220\u2013231","DOI":"10.1109\/ICDE.1997.581756"},{"key":"506_CR17","unstructured":"Lerman IC (1981) Classification et analyse ordinale des donn\u00e9es. Dunod, Paris"},{"key":"506_CR18","doi-asserted-by":"crossref","unstructured":"Lerman IC (1993) Likelihood linkage analysis classification method. Biochimie 75:379\u2013397","DOI":"10.1016\/0300-9084(93)90172-O"},{"key":"506_CR19","doi-asserted-by":"crossref","unstructured":"Silberschatz A, Tuzhilin A (1996) What makes patterns interesting in knowledge discovery systems. IEEE Trans on Knowl Data Eng 8(6):970\u2013974","DOI":"10.1109\/69.553165"},{"key":"506_CR20","doi-asserted-by":"crossref","unstructured":"Skowron A, Stepaniuk J (2004) Information granules and rough-neuro computing. In: Pal SK, Polkowski L, Skowron A (eds) Rough-neural computing: Techniques for computing with words, Springer, Berlin Heidelberg New York, pp 43\u201384","DOI":"10.1007\/978-3-642-18859-6_3"},{"key":"506_CR21","unstructured":"Toivonen H, Klementtinen M, Ronkainen P, H\u00e4t\u00f6nen K, Mannila H (1995) Pruning and grouping of discovered association rules. In: Workshop notes of the ECML workshop on statistics, machine learning, and knowledge discovery in databases. MLnet, Heraklion, pp 47\u201352"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-005-0506-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-005-0506-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-005-0506-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:39:46Z","timestamp":1559093986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-005-0506-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,19]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["506"],"URL":"https:\/\/doi.org\/10.1007\/s00500-005-0506-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7,19]]}}}