Pub Date : 2004-09-15DOI: 10.1016/J.INFSOF.2004.02.004
L. Teng
{"title":"Normal Forms for XML Documents","authors":"L. Teng","doi":"10.1016/J.INFSOF.2004.02.004","DOIUrl":"https://doi.org/10.1016/J.INFSOF.2004.02.004","url":null,"abstract":"","PeriodicalId":143938,"journal":{"name":"Mini-micro Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127116816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.4018/978-1-59904-120-9.CH002
Faxin Zhao, Y. Bao, Huanliang Sun, Ge Yu
Outlier Detection is an important research issue in Data Mining,the number of cells in the cell-based disk algorithm increases exponentially.The performance of this algorithm will decrease dramatically with the increasing of the number of cell and data points.Further analysis finds that there are many empty cells that are useless to outlier detection.To overcome these shortcomings,this paper apply the CD-Tree to index non-empty cells,and cluster technique is adopted to store the data objects in the same cell into linked disk pages.Some experiments are made to test the performance of the proposed algorithms.The experimental results show that the performance of the CD-Tree based and cluster-based disk algorithms are outperformed that of the cell-based disk algorithm,and the number of dimensions processed by the proposed algorithms is higher than that of the old one.
{"title":"A Disk-Based Algorithm for Fast Outlier Detection in Large Datasets","authors":"Faxin Zhao, Y. Bao, Huanliang Sun, Ge Yu","doi":"10.4018/978-1-59904-120-9.CH002","DOIUrl":"https://doi.org/10.4018/978-1-59904-120-9.CH002","url":null,"abstract":"Outlier Detection is an important research issue in Data Mining,the number of cells in the cell-based disk algorithm increases exponentially.The performance of this algorithm will decrease dramatically with the increasing of the number of cell and data points.Further analysis finds that there are many empty cells that are useless to outlier detection.To overcome these shortcomings,this paper apply the CD-Tree to index non-empty cells,and cluster technique is adopted to store the data objects in the same cell into linked disk pages.Some experiments are made to test the performance of the proposed algorithms.The experimental results show that the performance of the CD-Tree based and cluster-based disk algorithms are outperformed that of the cell-based disk algorithm,and the number of dimensions processed by the proposed algorithms is higher than that of the old one.","PeriodicalId":143938,"journal":{"name":"Mini-micro Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114286633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：