{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T14:53:27Z","timestamp":1781103207138,"version":"3.54.1"},"reference-count":27,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"abstract":"<p>Spirit diagnosing is an important theory in TCM (Traditional Chinese Medicine), by which a TCM doctor can diagnose a patient\u2019s body state. But this theory is complicated and difficult to master simply learned from books. To further the theory and skill of spirit diagnosing, in this paper, the authors propose a remote education system that can accept videos from a user and give the user an auto-diagnosed spirit. The key technology in this system is eye feature computation in spirit diagnosing, for which rules describing \u201cthe spirit\u201d (spirit in TCM refers to the human\u2019s mental state which reflects the one\u2019s general physical condition) state are mined by the quantitative features regarding the human eyes. With videos capturing eye condition during a short period, a set of eye features are extracted. On this basis, attribute intervals of the eye feature space is generated by CAIM (class-attribute interdependence maximization). Several of the candidate rules are then mined by the association rule based on the cloud model. Finally, three complementary rule-pruning methods are modified and combined to trim the candidate rules. The cross validation test for mined rules has an average accuracy of 93%, which shows the high performance of the proposed method.<\/p>","DOI":"10.4018\/jdet.2011010107","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T15:28:04Z","timestamp":1297783684000},"page":"101-113","source":"Crossref","is-referenced-by-count":1,"title":["Research on Key Technology in Remote Education System of Spirit Diagnosing by Eye in TCM"],"prefix":"10.4018","volume":"9","author":[{"given":"Feng","family":"Guo","sequence":"first","affiliation":[{"name":"Xiamen University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaozi","family":"Li","sequence":"additional","affiliation":[{"name":"Xiamen University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Dai","sequence":"additional","affiliation":[{"name":"Iwate Prefectural University, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changle","family":"Zhou","sequence":"additional","affiliation":[{"name":"Xiamen University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Lin","sequence":"additional","affiliation":[{"name":"Xiamen University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jdet.2011010107-0","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1693"},{"key":"jdet.2011010107-1","doi-asserted-by":"crossref","unstructured":"Agarwal, R. C., Aggarwal, C. C., & Prasad, V. V. V. (2000). Depth first generation of long patterns. In Proceedings of the ACM SIGMOD Conference.","DOI":"10.1145\/347090.347114"},{"key":"jdet.2011010107-2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM-SIGMOD International Conference on Management of Data (SIGMOD\u201993) (pp. 207-216).","DOI":"10.1145\/170035.170072"},{"key":"jdet.2011010107-3","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 1994 International Conference on Very Large Data Bases (VLDB\u201994), Santiago, Chile (pp. 487-499)."},{"key":"jdet.2011010107-4","doi-asserted-by":"crossref","unstructured":"Bayardo, R. J. (1998). Efficiently mining long patterns from databases. In Proceedings of the 1998 ACM-SIGMOD International Conference on Management of Data, Seattle, WA (SIGMOD\u201998) (pp. 85-93).","DOI":"10.1145\/276304.276313"},{"key":"jdet.2011010107-5","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997). Dynamic itemset counting and implication rules for market basket analysis. In Proceedings of the 1997 ACM-SIGMOD International Conference on Management of Data (SIGMOD\u201997), Tucson, AZ (pp. 255-264).","DOI":"10.1145\/253260.253325"},{"key":"jdet.2011010107-6","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., & Gehrke, J. (2001). MAFIA: a maximal frequent itemset algorithm for transactional databases. In Proceedings of the 2001 International Conference on Data Engineering (ICDE\u201901), Heidelberg, Germany (pp. 443-452).","DOI":"10.1109\/ICDE.2001.914857"},{"key":"jdet.2011010107-7","doi-asserted-by":"crossref","unstructured":"Cheung, D. W., Han, J., Ng, V., & Wong, C. Y. (1996). Maintenance of discovered association rules in large an incremental updating technique. In Proceedings of the 1996 International Conference on Data Engineering (ICDE\u201996), New Orleans, LA (pp. 106-114).","DOI":"10.1109\/ICDE.1996.492094"},{"key":"jdet.2011010107-8","unstructured":"Feng, G., & Shaozi, L. (2007). Mining Combined Detection of Tumor Marker Based on Cloud Model. In Proceedings of ISKE-2007."},{"key":"jdet.2011010107-9","doi-asserted-by":"crossref","unstructured":"Gouda, K., & Zaki, M. J. (2001). Efficiently mining maximal frequent itemsets. In Proceedings of the IEEE International Conference on Data Mining, San Jose, CA.","DOI":"10.1109\/ICDM.2001.989514"},{"key":"jdet.2011010107-10","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM-SIGMOD International Conference on Management of Data (SIGMOD\u201900), Dallas, TX (pp. 1-12).","DOI":"10.1145\/342009.335372"},{"key":"jdet.2011010107-11","doi-asserted-by":"publisher","DOI":"10.1145\/273244.273257"},{"key":"jdet.2011010107-12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269594"},{"key":"jdet.2011010107-13","doi-asserted-by":"crossref","unstructured":"Liu, J., Pan, Y., Wang, K., & Han, J. (2002) Mining frequent item sets by opportunistic projection. In Proceedings of the 2002 ACM SIGKDD International Conference on Knowledge Discovery in Databases (KDD\u201902), Edmonton, AB, Canada (pp. 239-248).","DOI":"10.1145\/775047.775081"},{"key":"jdet.2011010107-14","doi-asserted-by":"crossref","unstructured":"Park, J. S., Chen, M. S., & Yu, P. S. (1995). CLOSET:An effective hash-based algorithm for mining association rules. In Proceedings of the 1995 ACM-SIGMOD International Conference on Management of Data (SIGMOD\u201995), San Jose, CA (pp. 175-186).","DOI":"10.1145\/223784.223813"},{"key":"jdet.2011010107-15","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., & Taouil, R. (1999). Discovering frequent closed itemsets for association rules. In Proceedings of the 7th International Conference on Database Theory (ICDT\u201999), Jerusalem, Israel (pp.398-416).","DOI":"10.1007\/3-540-49257-7_25"},{"key":"jdet.2011010107-16","unstructured":"Pei, J., Han, J., & Mao, R. (2000). An efficient algorithm for mining frequent closed itemsets. In Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, TX."},{"key":"jdet.2011010107-17","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., et al. (2001). PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth. In Proceedings of the 2001 International Conference on Data Engineering (ICDE\u201901), Heidelberg, Germany (pp. 215-224)."},{"key":"jdet.2011010107-18","unstructured":"Savasere, A., Omiecinski, E., & Navathe, S. (1995). An efficient algorithm for mining association rules in large databases. In Proceedings of the 1995 International Conference on Very Large Data Bases (VLDB\u201995), Zurich, Switzerland (pp. 432-443)."},{"key":"jdet.2011010107-19","unstructured":"Toivonen, H. (1996). Sampling large databases for association rules. In Proceedings of the 1996 International Conference on Very Large Data Bases (VLDB\u201996), Bombay, India (pp. 134-145)."},{"key":"jdet.2011010107-20","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., & Pei, J. (2003). Closet+: Searching for the bests strategies for mining frequent closed itemsets. In Proceedings of ACM SIGKDD\u201903, Washington, DC.","DOI":"10.1145\/956750.956779"},{"issue":"6","key":"jdet.2011010107-21","first-page":"1032","article-title":"Traditional Chinese Medicine Tongue Recognition and Image Analysis Technology.","volume":"23","author":"M.Weiwu","year":"2005","journal-title":"Chinese Archives of Traditional Chinese Medicine"},{"issue":"1","key":"jdet.2011010107-22","first-page":"62","article-title":"Study progress of the TCM Pulse Transducer.","volume":"19","author":"H.Yan","year":"2005","journal-title":"ACTA Universitatis Traditionis Medicalis Sinensis Pharmacologiaeque Shanghai"},{"issue":"1","key":"jdet.2011010107-23","first-page":"29","article-title":"Mining Association Rules Based on Cloud Model.","volume":"1","author":"D.Yi","year":"2000","journal-title":"Journal of PLA University of Science and Technology"},{"issue":"15","key":"jdet.2011010107-24","first-page":"75","article-title":"Combined Detection of Tumor Marker Based on Cloud Model.","volume":"34","author":"L.Ying","year":"2008","journal-title":"Computer Engineering"},{"key":"jdet.2011010107-25","doi-asserted-by":"crossref","unstructured":"Zaki, M. J., & Hsiao, C. (2002). CHARM: An efficient algorithm for closed itemset mining. In Proceedings of the 2nd SIAM International Conference on Data Mining (pp. 12-28).","DOI":"10.1137\/1.9781611972726.27"},{"key":"jdet.2011010107-26","unstructured":"Zou, Q., Chu, W., & Lu, B. (2002).SmartMiner: A depth first algorithm guided by tail information for mining maximal frequent itemsets. In Proceedings of the IEEE International Conference on Data Mining."}],"container-title":["International Journal of Distance Education Technologies"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=49720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T17:28:43Z","timestamp":1654104523000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jdet.2011010107"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jdet.2011010107","relation":{},"ISSN":["1539-3100","1539-3119"],"issn-type":[{"value":"1539-3100","type":"print"},{"value":"1539-3119","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}