{"title":"全球基因表达数据的量化","authors":"Tae-Hoon Chung, M. Brun, Seungchan Kim","doi":"10.1109/ICMLA.2006.42","DOIUrl":null,"url":null,"abstract":"Many researchers are investigating the possibility of utilizing global gene expression profile data as a platform to infer gene regulatory networks. However, heavy computational burden and measurement noises render these efforts difficult and approaches based on quantized levels are vigorously investigated as an alternative. Methods based on quantized values require a procedure to convert continuous expression values into discrete ones. Although there have been algorithms to quantize values into multiple discrete states, these algorithms assumed strict state mixtures (SSM,) so that all expression profiles were divided into pre-specified number of states. We propose two novel quantization algorithms (QAs), model-based quantization algorithm and model-free quantization algorithm that generalize SSM algorithms in two major aspects. First, our QAs assume the maximum number of expression states (Es) be arbitrary. Second, expression profiles can exhibit any combinations of Es possible states. In this paper, we compare the performances between SSM algorithms and QAs using simulation studies as well as applications to actual data and show that quantizing gene expression data using adaptive algorithms is an effective way to reduce data complexity without sacrificing much of essential information","PeriodicalId":297071,"journal":{"name":"2006 5th International Conference on Machine Learning and Applications (ICMLA'06)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Quantization of Global Gene Expression Data\",\"authors\":\"Tae-Hoon Chung, M. Brun, Seungchan Kim\",\"doi\":\"10.1109/ICMLA.2006.42\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many researchers are investigating the possibility of utilizing global gene expression profile data as a platform to infer gene regulatory networks. However, heavy computational burden and measurement noises render these efforts difficult and approaches based on quantized levels are vigorously investigated as an alternative. Methods based on quantized values require a procedure to convert continuous expression values into discrete ones. Although there have been algorithms to quantize values into multiple discrete states, these algorithms assumed strict state mixtures (SSM,) so that all expression profiles were divided into pre-specified number of states. We propose two novel quantization algorithms (QAs), model-based quantization algorithm and model-free quantization algorithm that generalize SSM algorithms in two major aspects. First, our QAs assume the maximum number of expression states (Es) be arbitrary. Second, expression profiles can exhibit any combinations of Es possible states. In this paper, we compare the performances between SSM algorithms and QAs using simulation studies as well as applications to actual data and show that quantizing gene expression data using adaptive algorithms is an effective way to reduce data complexity without sacrificing much of essential information\",\"PeriodicalId\":297071,\"journal\":{\"name\":\"2006 5th International Conference on Machine Learning and Applications (ICMLA'06)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 5th International Conference on Machine Learning and Applications (ICMLA'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMLA.2006.42\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 5th International Conference on Machine Learning and Applications (ICMLA'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLA.2006.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Many researchers are investigating the possibility of utilizing global gene expression profile data as a platform to infer gene regulatory networks. However, heavy computational burden and measurement noises render these efforts difficult and approaches based on quantized levels are vigorously investigated as an alternative. Methods based on quantized values require a procedure to convert continuous expression values into discrete ones. Although there have been algorithms to quantize values into multiple discrete states, these algorithms assumed strict state mixtures (SSM,) so that all expression profiles were divided into pre-specified number of states. We propose two novel quantization algorithms (QAs), model-based quantization algorithm and model-free quantization algorithm that generalize SSM algorithms in two major aspects. First, our QAs assume the maximum number of expression states (Es) be arbitrary. Second, expression profiles can exhibit any combinations of Es possible states. In this paper, we compare the performances between SSM algorithms and QAs using simulation studies as well as applications to actual data and show that quantizing gene expression data using adaptive algorithms is an effective way to reduce data complexity without sacrificing much of essential information