In recent years, cluster analysis and association analysis have attracted a lot of attention for large data analysis such as biomedical data analysis. This paper proposes a novel algorithm of frequent closed itemset mining. The algorithm addresses two challenges of data mining: mining large and high dimensional data and interpreting the results of data mining. Frequent itemset mining is the key task of association analysis. The algorithm is based on concept lattice structure so that frequent closed itemsets can be generated to reduce the complicity of mining all frequent itemsets and each frequent closed itemset has more information to facilitate interpretation of mining results. From this feature, the paper also discusses the extension of the algorithm for cluster analysis. The experimental results show the efficiency of this algorithm.
{"title":"Frequent Closed Informative Itemset Mining","authors":"Huaiguo Fu, Mícheál Ó Foghlú, W. Donnelly","doi":"10.1109/CIS.2007.228","DOIUrl":"https://doi.org/10.1109/CIS.2007.228","url":null,"abstract":"In recent years, cluster analysis and association analysis have attracted a lot of attention for large data analysis such as biomedical data analysis. This paper proposes a novel algorithm of frequent closed itemset mining. The algorithm addresses two challenges of data mining: mining large and high dimensional data and interpreting the results of data mining. Frequent itemset mining is the key task of association analysis. The algorithm is based on concept lattice structure so that frequent closed itemsets can be generated to reduce the complicity of mining all frequent itemsets and each frequent closed itemset has more information to facilitate interpretation of mining results. From this feature, the paper also discusses the extension of the algorithm for cluster analysis. The experimental results show the efficiency of this algorithm.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129418235","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}
Jingqiu Xu, Zhengyu Zhu, Xiang Ren, Yunyan Tian, Ying Luo
Current Web search engines are built to serve all users, regardless of special needs of any individual user. So personalization of Web search is to carry out retrieval for each user incorporating his/her interests. A novel query expansion algorithm is proposed in this paper. It is based on a model of personalized web search system, which can learn a user's preference implicitly and then generate the user profile automatically. When the user inputs query keywords, more personalized expansion words are generated by the proposed algorithm, and then these words together with the query keywords are submitted to a popular search engine such as Baidu or Google. These expansion words can help search engines retrieval information for a user according to his/her implicit search intentions, and return different search results to different users who input the same keywords.
{"title":"Personalized Web Search Using User Profile","authors":"Jingqiu Xu, Zhengyu Zhu, Xiang Ren, Yunyan Tian, Ying Luo","doi":"10.1109/CIS.2007.167","DOIUrl":"https://doi.org/10.1109/CIS.2007.167","url":null,"abstract":"Current Web search engines are built to serve all users, regardless of special needs of any individual user. So personalization of Web search is to carry out retrieval for each user incorporating his/her interests. A novel query expansion algorithm is proposed in this paper. It is based on a model of personalized web search system, which can learn a user's preference implicitly and then generate the user profile automatically. When the user inputs query keywords, more personalized expansion words are generated by the proposed algorithm, and then these words together with the query keywords are submitted to a popular search engine such as Baidu or Google. These expansion words can help search engines retrieval information for a user according to his/her implicit search intentions, and return different search results to different users who input the same keywords.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125088615","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}
A password-based authenticated key exchange (PAKE) protocol in the three-party setting allows two clients com- municating over a public network to agree on a common session key with the help of a server. In the setting the users do not share a password between themselves, but only with the server. In this paper, we propose a new efficient password-based authenticated three-party key ex- change protocol and provide a rigorous conclusion of for- ward security for it in both the random-oracle and the ideal- cipher models under the gap Diffie-Hellman intractability assumption. It is a significant advantage that our proto- col is proved secure in a model that allows the adversary to make adaptive corrupt queries, in contrast to previous solutions.
{"title":"Forward Security for an Efficient Password-Based Authenticated Key Exchange","authors":"Tingjun Liu, Shuhua Wu, Yuefei Zhu","doi":"10.1109/CIS.2007.185","DOIUrl":"https://doi.org/10.1109/CIS.2007.185","url":null,"abstract":"A password-based authenticated key exchange (PAKE) protocol in the three-party setting allows two clients com- municating over a public network to agree on a common session key with the help of a server. In the setting the users do not share a password between themselves, but only with the server. In this paper, we propose a new efficient password-based authenticated three-party key ex- change protocol and provide a rigorous conclusion of for- ward security for it in both the random-oracle and the ideal- cipher models under the gap Diffie-Hellman intractability assumption. It is a significant advantage that our proto- col is proved secure in a model that allows the adversary to make adaptive corrupt queries, in contrast to previous solutions.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125798172","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}
Safaa O. Al-Mamory Hong Li Zhang School of Computer Science, School of Computer Science, Harbin Institute of technology, Harbin Institute of technology, Harbin, China Harbin, China Safaa_vb@yahoo.com zhl@pact518.hit.edu.cn Abstract Intrusion alert correlation techniques correlate alerts into meaningful groups or attack scenarios for the ease to understand by human analysts. These correlation techniques have different strengths and limitations. However, all of them depend heavily on the underlying network intrusion detection systems (NIDSs) and perform poorly when the NIDSs miss critical attacks. In this paper, a system was proposed to represents a set of alerts as subattacks. Then correlates these subattacks and generates abstracted correlation graphs (CGs) which reflect attack scenarios. It also represents attack scenarios by classes of alerts instead of alerts themselves to reduce the rules required and to detect new variations of attacks. The experiments were conducted using Snort as NIDS with different datasets which contain multistep attacks. The resulted CGs imply that our method can correlate related alerts, uncover the attack strategies, and can detect new variations of attacks.
Safaa O. Al-Mamory Hong Li Zhang哈尔滨工业大学计算机科学学院哈尔滨，中国哈尔滨Safaa_vb@yahoo.com zhl@pact518.hit.edu.cn摘要入侵警报关联技术将警报关联到有意义的组或攻击场景中，以便于人类分析人员理解。这些相关技术有不同的优点和局限性。然而，它们都严重依赖于底层的网络入侵检测系统(nids)，当nids错过关键攻击时，它们的性能很差。本文提出了一种将一组警报表示为子攻击的系统。然后将这些子攻击进行关联，生成反映攻击场景的抽象关联图(CGs)。它还按警报类别(而不是警报本身)表示攻击场景，以减少所需的规则并检测新的攻击变体。实验使用Snort作为包含多步骤攻击的不同数据集的NIDS进行。结果表明，我们的方法可以将相关警报关联起来，揭示攻击策略，并可以检测到新的攻击变化。
{"title":"Scenario Discovery Using Abstracted Correlation Graph","authors":"S. Al-Mamory, Hongli Zhang","doi":"10.1109/CIS.2007.21","DOIUrl":"https://doi.org/10.1109/CIS.2007.21","url":null,"abstract":"Safaa O. Al-Mamory Hong Li Zhang School of Computer Science, School of Computer Science, Harbin Institute of technology, Harbin Institute of technology, Harbin, China Harbin, China Safaa_vb@yahoo.com zhl@pact518.hit.edu.cn Abstract Intrusion alert correlation techniques correlate alerts into meaningful groups or attack scenarios for the ease to understand by human analysts. These correlation techniques have different strengths and limitations. However, all of them depend heavily on the underlying network intrusion detection systems (NIDSs) and perform poorly when the NIDSs miss critical attacks. In this paper, a system was proposed to represents a set of alerts as subattacks. Then correlates these subattacks and generates abstracted correlation graphs (CGs) which reflect attack scenarios. It also represents attack scenarios by classes of alerts instead of alerts themselves to reduce the rules required and to detect new variations of attacks. The experiments were conducted using Snort as NIDS with different datasets which contain multistep attacks. The resulted CGs imply that our method can correlate related alerts, uncover the attack strategies, and can detect new variations of attacks.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127251164","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 paper is concerned with finding the refined bounds on the value of fuzzy solution to fuzzy programming prob- lem. In this paper we first present the definitions which are the sum of pairs expected value (SPEV), the expected value of the reference scenario (EVRS)and the expectation of pairs expected value (EPEV), and obtain the value of fuzzy solution (VFS) defined by difference between the re- course problem solution and the expected value of reference solution. In addition, several numerical examples are also given in order to explain the definitions specifically. Finally, the properties concerning the concepts are studied, which result in refined bounds on the value of fuzzy solution.
{"title":"Bounds on the Value of Fuzzy Solution to Fuzzy Programming Problem","authors":"Mingfa Zheng, Yian-Kui Liu","doi":"10.1109/CIS.2007.96","DOIUrl":"https://doi.org/10.1109/CIS.2007.96","url":null,"abstract":"The paper is concerned with finding the refined bounds on the value of fuzzy solution to fuzzy programming prob- lem. In this paper we first present the definitions which are the sum of pairs expected value (SPEV), the expected value of the reference scenario (EVRS)and the expectation of pairs expected value (EPEV), and obtain the value of fuzzy solution (VFS) defined by difference between the re- course problem solution and the expected value of reference solution. In addition, several numerical examples are also given in order to explain the definitions specifically. Finally, the properties concerning the concepts are studied, which result in refined bounds on the value of fuzzy solution.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126737599","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}
Tianjie Cao, Shi Huang, Hui Cui, Yipeng Wu, Qihan Luo
How to leak authoritative secrets in an elegant way? The paper aims to solve this problem. The desired security properties i.e. Semantic-Security; Recipient-Designation; Verification-Dependence; Designated-Verifier Signature-Verifiability; Public Signature-Verifiability; Recipient-Ambiguity; Designated-Verifier Recipient-Verifiability; Public Recipient-Verifiability; Signer-Ambiguity; Signer- Verifiability are specified in secret leakage. Based on Chow-Yiu-Hui's ID-based ring signature scheme and techniques of zero-knowledge proof, an ID-based controlled secret leakage scheme is proposed. The proposed scheme satisfies all specified security properties and can be used in trust negotiation.
{"title":"Controlled Secret Leakage","authors":"Tianjie Cao, Shi Huang, Hui Cui, Yipeng Wu, Qihan Luo","doi":"10.4304/jcp.4.1.61-68","DOIUrl":"https://doi.org/10.4304/jcp.4.1.61-68","url":null,"abstract":"How to leak authoritative secrets in an elegant way? The paper aims to solve this problem. The desired security properties i.e. Semantic-Security; Recipient-Designation; Verification-Dependence; Designated-Verifier Signature-Verifiability; Public Signature-Verifiability; Recipient-Ambiguity; Designated-Verifier Recipient-Verifiability; Public Recipient-Verifiability; Signer-Ambiguity; Signer- Verifiability are specified in secret leakage. Based on Chow-Yiu-Hui's ID-based ring signature scheme and techniques of zero-knowledge proof, an ID-based controlled secret leakage scheme is proposed. The proposed scheme satisfies all specified security properties and can be used in trust negotiation.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121423486","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}
Fault diagnosis plays a very important role to the security of networks. Cluster-Based Comparison Diagnosis Algorithm for ad hoc networks is presented in this paper. By making use of the concentrative control function of the cluster-heads in hierarchical ad-hoc networks, the diagnosis process is optimized, and correct diagnosis for all mobile hosts can be implemented as dynamic network topology is presented. The correctness of the algorithm is proved and the performance is analyzed. Simulation results indicate that comparing with the Comparison-Based Fault Diagnosis Algorithm, the Cluster-Based Comparison Diagnosis Algorithm results in smaller system overhead.
{"title":"Cluster-Based System-Level Fault Diagnosis in Hierarchical Ad-Hoc Networks","authors":"Dongni Li","doi":"10.1109/CIS.2007.14","DOIUrl":"https://doi.org/10.1109/CIS.2007.14","url":null,"abstract":"Fault diagnosis plays a very important role to the security of networks. Cluster-Based Comparison Diagnosis Algorithm for ad hoc networks is presented in this paper. By making use of the concentrative control function of the cluster-heads in hierarchical ad-hoc networks, the diagnosis process is optimized, and correct diagnosis for all mobile hosts can be implemented as dynamic network topology is presented. The correctness of the algorithm is proved and the performance is analyzed. Simulation results indicate that comparing with the Comparison-Based Fault Diagnosis Algorithm, the Cluster-Based Comparison Diagnosis Algorithm results in smaller system overhead.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121719472","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}
Yee Wan Wong, K. Seng, L. Ang, Wan Yong Khor, Fui Liau
In this paper, a new multimodal biometric recognition system based on feature fusion is proposed to increase the robustness and circumvention of conventional multimodal recognition system. The feature sets originating from the output of the visual and audio feature extraction systems are fused and being classified by RBF neural network. Other than that, 2DPCA is proposed to work in conjunction with LDA to further increase the recognition performance of the visual recognition system. The experimental result shows that the proposed system achieves a higher recognition rate as compared to the conventional multimodal recognition system. Besides, we also show that the 2DPCA+LDA achieves a higher recognition rate as compared with PCA, PCA+LDA and 2DPCA.
{"title":"Audio-Visual Recognition System with Intra-Modal Fusion","authors":"Yee Wan Wong, K. Seng, L. Ang, Wan Yong Khor, Fui Liau","doi":"10.1109/CIS.2007.196","DOIUrl":"https://doi.org/10.1109/CIS.2007.196","url":null,"abstract":"In this paper, a new multimodal biometric recognition system based on feature fusion is proposed to increase the robustness and circumvention of conventional multimodal recognition system. The feature sets originating from the output of the visual and audio feature extraction systems are fused and being classified by RBF neural network. Other than that, 2DPCA is proposed to work in conjunction with LDA to further increase the recognition performance of the visual recognition system. The experimental result shows that the proposed system achieves a higher recognition rate as compared to the conventional multimodal recognition system. Besides, we also show that the 2DPCA+LDA achieves a higher recognition rate as compared with PCA, PCA+LDA and 2DPCA.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121106563","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 the vision of pervasive computing, there are a great diversity of services in the environment and a great deal of nomadic users walking through them. The traditional proof-making mechanisms of access control are no longer appropriate for the new context, in which people expect to access information in a more flexible and non-intrusive way. Instead of asking people for the certificates, this paper advocates a direct certifying mechanism, in which delegation relationships are directly verified by asking the delegator. By dynamically discovering potential credential chains a trust community is maintained. Existed credential chain discovery methods are not scalable enough for that they either need collecting all credentials in the system or need referring to all the potential users. In our approach, each user keeps a trust list to reduce the fan-out of searching steps. The simulation shows that the performance is greatly improved.
{"title":"A Novel Trust Community Based on Direct Certifying for Pervasive Computing Systems","authors":"Zhiyu Peng, Shanping Li, Xin Lin","doi":"10.1109/CIS.2007.93","DOIUrl":"https://doi.org/10.1109/CIS.2007.93","url":null,"abstract":"In the vision of pervasive computing, there are a great diversity of services in the environment and a great deal of nomadic users walking through them. The traditional proof-making mechanisms of access control are no longer appropriate for the new context, in which people expect to access information in a more flexible and non-intrusive way. Instead of asking people for the certificates, this paper advocates a direct certifying mechanism, in which delegation relationships are directly verified by asking the delegator. By dynamically discovering potential credential chains a trust community is maintained. Existed credential chain discovery methods are not scalable enough for that they either need collecting all credentials in the system or need referring to all the potential users. In our approach, each user keeps a trust list to reduce the fan-out of searching steps. The simulation shows that the performance is greatly improved.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126110236","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}
A novel method to reduce dimensionality for face representation and recognition was proposed in this paper. This technique attempts to preserve both the intrinsic neighborhood geometry of the data samples and the global geometry. It is derived from ONPP. The main difference between ONPP and 2d-NPP is that the latter does not change the input images to vectors, and works well under the undersampled size situation. First, an "affinity" graph was built for the data in 2D- NPP, in a way that is similar to the method of LLE. While the input was mapped to the reduced spaces implicitly in LLE, 2D-NPP employs an explicit linear mapping between the two. So it is trivial to handle the new data just by a simple linear transformation. We also show that is easy to apply the method in a supervised setting. Numerical experiments are reported to illustrate the performance of 2D-NPP and to compare it with a few competing methods.
{"title":"2D-NPP: An Extension of Neighborhood Preserving Projection","authors":"Zirong Li, Minghui Du","doi":"10.1109/CIS.2007.23","DOIUrl":"https://doi.org/10.1109/CIS.2007.23","url":null,"abstract":"A novel method to reduce dimensionality for face representation and recognition was proposed in this paper. This technique attempts to preserve both the intrinsic neighborhood geometry of the data samples and the global geometry. It is derived from ONPP. The main difference between ONPP and 2d-NPP is that the latter does not change the input images to vectors, and works well under the undersampled size situation. First, an \"affinity\" graph was built for the data in 2D- NPP, in a way that is similar to the method of LLE. While the input was mapped to the reduced spaces implicitly in LLE, 2D-NPP employs an explicit linear mapping between the two. So it is trivial to handle the new data just by a simple linear transformation. We also show that is easy to apply the method in a supervised setting. Numerical experiments are reported to illustrate the performance of 2D-NPP and to compare it with a few competing methods.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131233675","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
扫码关注我们
求助内容：
应助结果提醒方式：