Research and development activities (R&D) as the core competitiveness in the high-tech enterprises play an extremely important role and far-reaching significance. In order to measure the R&D performance of the high-tech enterprises scientifically and accurately, this paper introduces the tree-structured growing self-organizing maps (TGSOM) network into the spatial data mining (SDM) to be used in spatial clustering. This method not only can make up the limitation of the more data limit and biggish computation in the common spatial data mining, but also overcome the restriction of traditional maps (SOFM) that must appoint in advance. The performance measurement of 110 high-tech enterprises in Hebei Province shows that the results given by this method are reliable.
{"title":"SDM Techniques Based on TGSOM and its Application in R&D Performance Evaluation","authors":"Zhibin Liu, Hanxian Hu","doi":"10.1109/WKDD.2009.27","DOIUrl":"https://doi.org/10.1109/WKDD.2009.27","url":null,"abstract":"Research and development activities (R&D) as the core competitiveness in the high-tech enterprises play an extremely important role and far-reaching significance. In order to measure the R&D performance of the high-tech enterprises scientifically and accurately, this paper introduces the tree-structured growing self-organizing maps (TGSOM) network into the spatial data mining (SDM) to be used in spatial clustering. This method not only can make up the limitation of the more data limit and biggish computation in the common spatial data mining, but also overcome the restriction of traditional maps (SOFM) that must appoint in advance. The performance measurement of 110 high-tech enterprises in Hebei Province shows that the results given by this method are reliable.","PeriodicalId":143250,"journal":{"name":"2009 Second International Workshop on Knowledge Discovery and Data Mining","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115780420","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}
The basic K-means is sensitive to the initial centre and easy to get stuck at local optimal value. To solve such problems, a new clustering algorithm is proposed based on simulated annealing. The algorithm views the clustering as optimization problem, the bisecting K-means splits the dataset into k clusters at first, and then run simulated annealing algorithm using the sum of distances between each pattern and its centre based on bisecting K-means as the aim function. To avoid the shortcomings of simulated annealing such as long computation time and low efficiency, a new data structure named sequence list is given. The experiment result shows the feasibility and validity of the proposed algorithm.
{"title":"K-means Optimization Algorithm for Solving Clustering Problem","authors":"Jinxin Dong, Min-yong Qi","doi":"10.1109/WKDD.2009.85","DOIUrl":"https://doi.org/10.1109/WKDD.2009.85","url":null,"abstract":"The basic K-means is sensitive to the initial centre and easy to get stuck at local optimal value. To solve such problems, a new clustering algorithm is proposed based on simulated annealing. The algorithm views the clustering as optimization problem, the bisecting K-means splits the dataset into k clusters at first, and then run simulated annealing algorithm using the sum of distances between each pattern and its centre based on bisecting K-means as the aim function. To avoid the shortcomings of simulated annealing such as long computation time and low efficiency, a new data structure named sequence list is given. The experiment result shows the feasibility and validity of the proposed algorithm.","PeriodicalId":143250,"journal":{"name":"2009 Second International Workshop on Knowledge Discovery and Data Mining","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114571249","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}
Aiming at the neglected selection for non-critical task in parallel structure, this paper provides a method of services selection based on grey relational analysis. It regards the execution time of critical task as the upper limit for the execution time of non-critical task, uses the execution time of non-critical task as the reference series, and takes other QoS criteria as compared series. And the grey relational grades represent the relational degree between the QoS criteria and the execution time; the grey relational grades are reduced to the QoS criteria’s weights, then evaluating the weighted sum of criteria in order to choose the optimized candidate Web QoS service of parallel structure. Though the selection sacrifices the execution time of non-critical task, it has no influence on the execution time of parallel structure, and improves other QoS criteria simultaneously. The instance analysis shows that the method is a composite service QoS optimization technique which does not affect the execution time of composite services and obtains the better service quality at the cost of sacrificing the execution time of non-critical task.
{"title":"A Service Selection Method of Non-critical Task in Parallel Structure","authors":"Hong-ning Zhu, Bin Zhang, Xian-wen Gao","doi":"10.1109/WKDD.2009.208","DOIUrl":"https://doi.org/10.1109/WKDD.2009.208","url":null,"abstract":"Aiming at the neglected selection for non-critical task in parallel structure, this paper provides a method of services selection based on grey relational analysis. It regards the execution time of critical task as the upper limit for the execution time of non-critical task, uses the execution time of non-critical task as the reference series, and takes other QoS criteria as compared series. And the grey relational grades represent the relational degree between the QoS criteria and the execution time; the grey relational grades are reduced to the QoS criteria’s weights, then evaluating the weighted sum of criteria in order to choose the optimized candidate Web QoS service of parallel structure. Though the selection sacrifices the execution time of non-critical task, it has no influence on the execution time of parallel structure, and improves other QoS criteria simultaneously. The instance analysis shows that the method is a composite service QoS optimization technique which does not affect the execution time of composite services and obtains the better service quality at the cost of sacrificing the execution time of non-critical task.","PeriodicalId":143250,"journal":{"name":"2009 Second International Workshop on Knowledge Discovery and Data Mining","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115764597","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}
Exploring the trivial workflow data needs high performance data processing technology. In this paper we put forward analysis method of workflow execution data based on data mining. The main idea of it is to retrieve the workflow data to a data warehouse and adopt OLAP technology and data mining method to support customers to select different measures and view the corresponding data in different dimensions and different abstract levels, which is important for them to make decision.
{"title":"Analysis Methods of Workflow Execution Data Based on Data Mining","authors":"Feng Lei, C. Hexin","doi":"10.1109/WKDD.2009.181","DOIUrl":"https://doi.org/10.1109/WKDD.2009.181","url":null,"abstract":"Exploring the trivial workflow data needs high performance data processing technology. In this paper we put forward analysis method of workflow execution data based on data mining. The main idea of it is to retrieve the workflow data to a data warehouse and adopt OLAP technology and data mining method to support customers to select different measures and view the corresponding data in different dimensions and different abstract levels, which is important for them to make decision.","PeriodicalId":143250,"journal":{"name":"2009 Second International Workshop on Knowledge Discovery and Data Mining","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128137326","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}
Research on a novel variable step function and use it in orthogonal wavelet transform least mean square (LMS) adaptive de-noising algorithm. The algorithmic principle was explained and the effect of orthogonal wavelet transform to arithmetic convergence speed was analyzed. A novel variable step function based on Sigmoid nonlinear functional relationship was proposed, and its characteristics were analyzed. It is applied to time domain LMS algorithm to analyze convergence speed and steady-state error of model identification. Then, the novel variable step function was used in orthogonal wavelet transform domain adaptive body vibration signal de-noising. The simulating results indicate that the novel variable step function gains well effect.
{"title":"Wavelet Transform Adaptive De-noising Algorithm and Application Based on a Novel Variable Step Function","authors":"Jingjing Jin, Xu Wang, Shilong Li, Yingnan Wu","doi":"10.1109/WKDD.2009.99","DOIUrl":"https://doi.org/10.1109/WKDD.2009.99","url":null,"abstract":"Research on a novel variable step function and use it in orthogonal wavelet transform least mean square (LMS) adaptive de-noising algorithm. The algorithmic principle was explained and the effect of orthogonal wavelet transform to arithmetic convergence speed was analyzed. A novel variable step function based on Sigmoid nonlinear functional relationship was proposed, and its characteristics were analyzed. It is applied to time domain LMS algorithm to analyze convergence speed and steady-state error of model identification. Then, the novel variable step function was used in orthogonal wavelet transform domain adaptive body vibration signal de-noising. The simulating results indicate that the novel variable step function gains well effect.","PeriodicalId":143250,"journal":{"name":"2009 Second International Workshop on Knowledge Discovery and Data Mining","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126794113","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}
While Shamir’s identity-based public key cryptosystem does not need the certificates, the key escrow of user’s private keys is inherent in such scheme. In 2003,the concept of certificateless signature scheme was introduced. In this new paradigm, the necessity of certificates has been successfully removed and the key escrow problem does not exist. Based on the ideas of certificateless signatures and Boneh et al.’s Short Signature Scheme, a certificateless proxy blind signature scheme is proposed in this paper. Compared with the existed schemes, the new scheme has the properties of strong unforgeability and strong Non-repudiation.
{"title":"Certificateless Proxy Blind Signature Scheme from Bilinear Pairings","authors":"Bo Zhang, Qiuliang Xu","doi":"10.1109/WKDD.2009.68","DOIUrl":"https://doi.org/10.1109/WKDD.2009.68","url":null,"abstract":"While Shamir’s identity-based public key cryptosystem does not need the certificates, the key escrow of user’s private keys is inherent in such scheme. In 2003,the concept of certificateless signature scheme was introduced. In this new paradigm, the necessity of certificates has been successfully removed and the key escrow problem does not exist. Based on the ideas of certificateless signatures and Boneh et al.’s Short Signature Scheme, a certificateless proxy blind signature scheme is proposed in this paper. Compared with the existed schemes, the new scheme has the properties of strong unforgeability and strong Non-repudiation.","PeriodicalId":143250,"journal":{"name":"2009 Second International Workshop on Knowledge Discovery and Data Mining","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127515211","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}
Visualizing the result of clustering is an important part of pattern recognition research. A novel method of visualizing the result of fuzzy clustering base on GIS is proposed, which doesn’t involve dimensionality reduction so that the key features are not missed. The experiment on real dataset shows its effectiveness.
{"title":"Visualizing the Result of Fuzzy Clustering Using GIS","authors":"J. Tan, Rujing Wang, Bingyu Sun","doi":"10.1109/WKDD.2009.12","DOIUrl":"https://doi.org/10.1109/WKDD.2009.12","url":null,"abstract":"Visualizing the result of clustering is an important part of pattern recognition research. A novel method of visualizing the result of fuzzy clustering base on GIS is proposed, which doesn’t involve dimensionality reduction so that the key features are not missed. The experiment on real dataset shows its effectiveness.","PeriodicalId":143250,"journal":{"name":"2009 Second International Workshop on Knowledge Discovery and Data Mining","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123275036","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}
In order to deal with dynamic change in a manufacturing environment, all kinds of manufacturing resources are reorganized as multifarious agents with different resources and capability. According to the automation level and working mode of each functional agent to finish its tasks in the manufacturing environment, the manufacturing resource agents are divided into three categories. In order to construct these various agents conveniently, a multi-layer structure is put forward. Based on the structure, the agents can not only rapidly deal with unexpected events, but also recognize and predict the environment change automatically to adjust their behavior. A manufacturing system hierarchical architecture based on MAS is also provided. According to the change of actual productive tasks and the difference of scheduling strategies, the manufacturing system can be reconstructed flexibly by changing the MAS structure and the granularity of the agents. Consequently, it can adapt to the rapid change of the manufacturing environment and the manufacturing resources.
{"title":"Multi-layer Intelligent Encapsulation of Manufacturing Resources for MAS-based Distributed Manufacturing System","authors":"Yan Cao, Jiang Du, Yu Bai, Lina Yang, Yanli Yang","doi":"10.1109/WKDD.2009.221","DOIUrl":"https://doi.org/10.1109/WKDD.2009.221","url":null,"abstract":"In order to deal with dynamic change in a manufacturing environment, all kinds of manufacturing resources are reorganized as multifarious agents with different resources and capability. According to the automation level and working mode of each functional agent to finish its tasks in the manufacturing environment, the manufacturing resource agents are divided into three categories. In order to construct these various agents conveniently, a multi-layer structure is put forward. Based on the structure, the agents can not only rapidly deal with unexpected events, but also recognize and predict the environment change automatically to adjust their behavior. A manufacturing system hierarchical architecture based on MAS is also provided. According to the change of actual productive tasks and the difference of scheduling strategies, the manufacturing system can be reconstructed flexibly by changing the MAS structure and the granularity of the agents. Consequently, it can adapt to the rapid change of the manufacturing environment and the manufacturing resources.","PeriodicalId":143250,"journal":{"name":"2009 Second International Workshop on Knowledge Discovery and Data Mining","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131314901","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}
The heart's mechanical activity while pumping out blood causes the vibration of physical and the object connecting with physical. The vibration is rhythmically with the heart rate and record as ballistocardiogram (BCG) on the spinal axis of the body. It is able to know human’s heart rate by measuring the vibration. BCG is weak non-stationary random signal and contains a lot of noise caused by the impact of human and equipment. So heart rate detection from the original acquisition BCG is difficult. Through discrete sequence wavelet transform, BCG is preprocessed by translation invariant method based on adaptive threshold wavelet shrinkage. Choosing proper wavelet base and adaptive threshold function, estimating the noise variance are done at the same time. The characteristics of BCG are retained while eliminating noise. Based on de-noised BCG, the heart rate of subject is detected by using pseudo-period detection method. A single channel ECG is recorded synchronously to test the veracity. The result shows that it is the same as heart rate gained from ECG.
{"title":"A Novel Heart Rate Detection Algorithm in Ballistocardiogram Based on Wavelet Transform","authors":"Jingjing Jin, Xu Wang, Shilong Li, Yingnan Wu","doi":"10.1109/WKDD.2009.98","DOIUrl":"https://doi.org/10.1109/WKDD.2009.98","url":null,"abstract":"The heart's mechanical activity while pumping out blood causes the vibration of physical and the object connecting with physical. The vibration is rhythmically with the heart rate and record as ballistocardiogram (BCG) on the spinal axis of the body. It is able to know human’s heart rate by measuring the vibration. BCG is weak non-stationary random signal and contains a lot of noise caused by the impact of human and equipment. So heart rate detection from the original acquisition BCG is difficult. Through discrete sequence wavelet transform, BCG is preprocessed by translation invariant method based on adaptive threshold wavelet shrinkage. Choosing proper wavelet base and adaptive threshold function, estimating the noise variance are done at the same time. The characteristics of BCG are retained while eliminating noise. Based on de-noised BCG, the heart rate of subject is detected by using pseudo-period detection method. A single channel ECG is recorded synchronously to test the veracity. The result shows that it is the same as heart rate gained from ECG.","PeriodicalId":143250,"journal":{"name":"2009 Second International Workshop on Knowledge Discovery and Data Mining","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131613161","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}
the main objective of 3D mesh watermarking is to maximize the watermark strength while minimizing the visual distortion. In this paper, we propose a novel 3D mesh watermarking based on the human visual system and mesh curvature. We analyze the region’s mean curvature and fluctuation of curvature, and then choose the appropriate regions with high visual masking degree, in order to embed the watermark by using the Interpolation Algorithm. The experimental results show that the watermark is capacious, invisible and robust against various attacks.
{"title":"A Novel Robust 3D Mesh Watermarking Ensuring the Human Visual System","authors":"Dazhi Han, Xingqiang Yang, Cai-ming Zhang","doi":"10.1109/WKDD.2009.189","DOIUrl":"https://doi.org/10.1109/WKDD.2009.189","url":null,"abstract":"the main objective of 3D mesh watermarking is to maximize the watermark strength while minimizing the visual distortion. In this paper, we propose a novel 3D mesh watermarking based on the human visual system and mesh curvature. We analyze the region’s mean curvature and fluctuation of curvature, and then choose the appropriate regions with high visual masking degree, in order to embed the watermark by using the Interpolation Algorithm. The experimental results show that the watermark is capacious, invisible and robust against various attacks.","PeriodicalId":143250,"journal":{"name":"2009 Second International Workshop on Knowledge Discovery and Data Mining","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131733359","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
扫码关注我们
求助内容：
应助结果提醒方式：