{"id":"https://openalex.org/W2101123011","doi":"https://doi.org/10.1109/emeit.2011.6022930","title":"Research on incremental decision tree algorithm","display_name":"Research on incremental decision tree algorithm","publication_year":2011,"publication_date":"2011-08-01","ids":{"openalex":"https://openalex.org/W2101123011","doi":"https://doi.org/10.1109/emeit.2011.6022930","mag":"2101123011"},"language":"en","primary_location":{"id":"doi:10.1109/emeit.2011.6022930","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emeit.2011.6022930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 2011 International Conference on Electronic & Mechanical Engineering and Information Technology","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046072725","display_name":"Qingyun Chi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210159676","display_name":"Zaozhuang University","ror":"https://ror.org/05x21tp94","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210159676"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Chi Qingyun","raw_affiliation_strings":["Department of Computer Zaozhuang University, ZaoZhuang, China","Department of Computer, Zaozhuang University, ZaoZhuang, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Zaozhuang University, ZaoZhuang, China","institution_ids":["https://openalex.org/I4210159676"]},{"raw_affiliation_string":"Department of Computer, Zaozhuang University, ZaoZhuang, China","institution_ids":["https://openalex.org/I4210159676"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046072725"],"corresponding_institution_ids":["https://openalex.org/I4210159676"],"apc_list":null,"apc_paid":null,"fwci":1.9575,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.88676033,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"28","issue":null,"first_page":"303","last_page":"306"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14225","display_name":"Advanced Sensor and Control Systems","score":0.7706999778747559,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T14225","display_name":"Advanced Sensor and Control Systems","score":0.7706999778747559,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.7627999782562256,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.8250331282615662},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7816967964172363},{"id":"https://openalex.org/keywords/id3-algorithm","display_name":"ID3 algorithm","score":0.7254011631011963},{"id":"https://openalex.org/keywords/incremental-decision-tree","display_name":"Incremental decision tree","score":0.6693775057792664},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.6569856405258179},{"id":"https://openalex.org/keywords/decision-tree-learning","display_name":"Decision tree learning","score":0.5940987467765808},{"id":"https://openalex.org/keywords/c4.5-algorithm","display_name":"C4.5 algorithm","score":0.5463630557060242},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5275806188583374},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5031532645225525},{"id":"https://openalex.org/keywords/decision-stump","display_name":"Decision stump","score":0.46307194232940674},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.45746949315071106},{"id":"https://openalex.org/keywords/intrusion-detection-system","display_name":"Intrusion detection system","score":0.4399242699146271},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4388121962547302},{"id":"https://openalex.org/keywords/alternating-decision-tree","display_name":"Alternating decision tree","score":0.41120970249176025},{"id":"https://openalex.org/keywords/naive-bayes-classifier","display_name":"Naive Bayes classifier","score":0.18245401978492737},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1247071623802185}],"concepts":[{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.8250331282615662},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7816967964172363},{"id":"https://openalex.org/C183931066","wikidata":"https://www.wikidata.org/wiki/Q1653378","display_name":"ID3 algorithm","level":5,"score":0.7254011631011963},{"id":"https://openalex.org/C10229987","wikidata":"https://www.wikidata.org/wiki/Q17083028","display_name":"Incremental decision tree","level":4,"score":0.6693775057792664},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.6569856405258179},{"id":"https://openalex.org/C5481197","wikidata":"https://www.wikidata.org/wiki/Q16766476","display_name":"Decision tree learning","level":3,"score":0.5940987467765808},{"id":"https://openalex.org/C52003472","wikidata":"https://www.wikidata.org/wiki/Q1022655","display_name":"C4.5 algorithm","level":4,"score":0.5463630557060242},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5275806188583374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5031532645225525},{"id":"https://openalex.org/C141291300","wikidata":"https://www.wikidata.org/wiki/Q5249244","display_name":"Decision stump","level":5,"score":0.46307194232940674},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.45746949315071106},{"id":"https://openalex.org/C35525427","wikidata":"https://www.wikidata.org/wiki/Q745881","display_name":"Intrusion detection system","level":2,"score":0.4399242699146271},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4388121962547302},{"id":"https://openalex.org/C120136583","wikidata":"https://www.wikidata.org/wiki/Q4736414","display_name":"Alternating decision tree","level":5,"score":0.41120970249176025},{"id":"https://openalex.org/C52001869","wikidata":"https://www.wikidata.org/wiki/Q812530","display_name":"Naive Bayes classifier","level":3,"score":0.18245401978492737},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1247071623802185},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/emeit.2011.6022930","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emeit.2011.6022930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 2011 International Conference on Electronic & Mechanical Engineering and Information Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2363542475"],"related_works":["https://openalex.org/W1648970942","https://openalex.org/W3130568217","https://openalex.org/W2134772268","https://openalex.org/W1129665612","https://openalex.org/W4387869645","https://openalex.org/W3117017830","https://openalex.org/W2356463514","https://openalex.org/W2143508752","https://openalex.org/W97367898","https://openalex.org/W1603140234"],"abstract_inverted_index":{"For":[0],"data":[1,43],"analysis":[2],"of":[3],"increase":[4],"rapidly":[5],"customer":[6],"behavior,":[7],"Web":[8],"log":[9],"analysis,":[10],"network":[11],"intrusion":[12],"detection":[13],"systems":[14],"and":[15,34,61,93],"other":[16],"online":[17],"classification":[18,33],"system,":[19],"how":[20],"to":[21,24,30,87],"quickly":[22,65],"adapt":[23],"new":[25,41,63,68,82],"samples":[26,64,83],"is":[27],"the":[28,55,73,94],"key":[29],"ensure":[31],"proper":[32],"sustainable":[35],"operation.":[36],"This":[37],"paper":[38],"presents":[39],"a":[40,67,89],"adaptation":[42],"incremental":[44],"decision":[45,58,69,75,90],"tree":[46,59,70,91,95],"algorithm,":[47,60],"which":[48],"combines":[49,53],"RAINFOREST":[50],"structure.":[51],"It":[52],"with":[54,81,99],"traditional":[56],"SPRINT":[57],"uses":[62],"train":[66],"based":[71],"on":[72],"original":[74],"tree.":[76],"The":[77],"improved":[78],"algorithm":[79],"deal":[80],"at":[84],"any":[85],"time":[86],"produce":[88],"related,":[92],"has":[96],"been":[97],"optimized":[98],"real-time.":[100]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}