2009 IEEE International Conference on Data Mining Workshops最新文献_第3页

High Quality True-Positive Prediction for Fiscal Fraud Detection 财政欺诈检测的高质量真正预测

2009 IEEE International Conference on Data Mining Workshops Pub Date : 2009-12-06 DOI: 10.1109/ICDMW.2009.59

S. Basta, Fabio Fassetti, M. Guarascio, G. Manco, F. Giannotti, D. Pedreschi, L. Spinsanti, Gianfilippo Papi, S. Pisani

引用次数: 14

Accurate Discovery of Valid Convoys from Moving Object Trajectories 从运动物体轨迹中准确发现有效车队

2009 IEEE International Conference on Data Mining Workshops Pub Date : 2009-12-06 DOI: 10.1109/ICDMW.2009.71

Hyunjin Yoon, C. Shahabi

引用次数: 31

Enhancing the DBSCAN and Agglomerative Clustering Algorithms to Solve Network Planning Problem 改进DBSCAN和聚类算法解决网络规划问题

2009 IEEE International Conference on Data Mining Workshops Pub Date : 2009-12-06 DOI: 10.1109/ICDMW.2009.98

L. F. Ibrahim, Weam M. Minshawi, Isra Yosef Ekkab, Nehal Mahmoud Al-Jurf, Afnan Salem Babrahim, Samar Faisl Al-Halees

{"title":"Enhancing the DBSCAN and Agglomerative Clustering Algorithms to Solve Network Planning Problem","authors":"L. F. Ibrahim, Weam M. Minshawi, Isra Yosef Ekkab, Nehal Mahmoud Al-Jurf, Afnan Salem Babrahim, Samar Faisl Al-Halees","doi":"10.1109/ICDMW.2009.98","DOIUrl":"https://doi.org/10.1109/ICDMW.2009.98","url":null,"abstract":"With existing telephone networks nearing saturation and demand for wire and wireless services continuing to grow, telecommunication engineers are looking at technologies that will deliver sites and can satisfy the required demand and grade of service constraints while achieving minimum possible costs. The city data is given as a map of streets, intersection nodes coordinates, distribution of the subscribers’ loads within the city and the location of base station in mobile network in this city. The available cable sizes, the cost per unit for each size and the maximum distance of wire that satisfied the allowed grade of service. NetPlan (Network Planning package) is developed in the spirit of DBSCAN and Agglomerative clustering algorithms. In this paper we studied the problem of congestion in Multi Service Access Node (MSAN) due to the increasing the number of subscribers which cause degradation in grade of service and in some time impossible to add new subscribers. The NetPlan algorithm is introduced to solve this problem. This algorithm is Density-based clustering algorithm using physical shortest paths available routes and the subscriber loads. In other hand decreasing the cost also is our deal in this paper so in the second phase in clustering process we modify the agglomerative algorithm that merge the neighboring cluster which satisfying certain condition. Experimental results and analysis indicate that the combination to algorithms was effective, leads to minimum costs for network construction and make the best grade of service.","PeriodicalId":351078,"journal":{"name":"2009 IEEE International Conference on Data Mining Workshops","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133286202","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}

引用次数: 7

Toolkit-Based High-Performance Data Mining of Large Data on MapReduce Clusters 基于工具箱的MapReduce集群大数据高性能数据挖掘

2009 IEEE International Conference on Data Mining Workshops Pub Date : 2009-12-06 DOI: 10.1109/ICDMW.2009.34

D. Wegener, M. Mock, Deyaa Adranale, S. Wrobel

引用次数: 62

Efficient Discovery of Closed Hyperclique Patterns in Multidimensional Structured Databases 多维结构化数据库中封闭超团模式的高效发现

2009 IEEE International Conference on Data Mining Workshops Pub Date : 2009-12-06 DOI: 10.1109/ICDMW.2009.10

Tomonobu Ozaki, T. Ohkawa

引用次数: 2

Determining the Training Window for Small Sample Size Classification with Concept Drift 基于概念漂移的小样本分类训练窗口的确定

2009 IEEE International Conference on Data Mining Workshops Pub Date : 2009-12-06 DOI: 10.1109/ICDMW.2009.20

I. Žliobaitė, L. Kuncheva

引用次数: 21

EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs 特征辐条:大图中的惊人模式和可扩展社区芯片

2009 IEEE International Conference on Data Mining Workshops Pub Date : 2009-12-06 DOI: 10.1007/978-3-642-13672-6_42

Aditya Prakash, Mukund Seshadri, Ashwin Sridharan, S. Machiraju, C. Faloutsos

引用次数: 164

Multi-granularity Visualization of Trajectory Clusters Using Sub-trajectory Clustering 基于子轨迹聚类的多粒度轨迹聚类可视化

2009 IEEE International Conference on Data Mining Workshops Pub Date : 2009-12-06 DOI: 10.1109/ICDMW.2009.24

Cheng Chang, Baoyao Zhou

引用次数: 20

Spatiotemporal Relational Random Forests 时空关联随机森林

2009 IEEE International Conference on Data Mining Workshops Pub Date : 2009-12-06 DOI: 10.1109/ICDMW.2009.89

Timothy A. Supinie, A. McGovern, John K. Williams, Jennifer Abernethy

引用次数: 10

Set-Based Boosting for Instance-Level Transfer 基于集的实例级传输增强

2009 IEEE International Conference on Data Mining Workshops Pub Date : 2009-12-06 DOI: 10.1109/ICDMW.2009.97

Eric Eaton, Marie desJardins

引用次数: 37