Littérature scientifique sur le sujet « Bicluter »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Bicluter ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Bicluter"
Wang, Miao, Xuequn Shang, Shaohua Zhang et Zhanhuai Li. « Efficient Mining Frequent Closed Discriminative Biclusters by Sample-Growth ». International Journal of Knowledge Discovery in Bioinformatics 1, no 4 (octobre 2010) : 69–88. http://dx.doi.org/10.4018/jkdb.2010100104.
Texte intégralYANG, JIONG, HAIXUN WANG, WEI WANG et PHILIP S. YU. « AN IMPROVED BICLUSTERING METHOD FOR ANALYZING GENE EXPRESSION PROFILES ». International Journal on Artificial Intelligence Tools 14, no 05 (octobre 2005) : 771–89. http://dx.doi.org/10.1142/s0218213005002387.
Texte intégralBustamam, Alhadi, Titin Siswantining, Tesdiq P. Kaloka et Olivia Swasti. « Application of BiMax, POLS, and LCM-MBC to Find Bicluster on Interactions Protein between HIV-1 and Human ». Austrian Journal of Statistics 49, no 3 (20 février 2020) : 1–18. http://dx.doi.org/10.17713/ajs.v49i3.1011.
Texte intégralYin, Lu, Junlin Qiu et Shangbing Gao. « Biclustering of Gene Expression Data Using Cuckoo Search and Genetic Algorithm ». International Journal of Pattern Recognition and Artificial Intelligence 32, no 11 (24 juillet 2018) : 1850039. http://dx.doi.org/10.1142/s0218001418500398.
Texte intégralMiao, Miao, Xue Qun Shang, Jia Cai Liu et Miao Wang. « MRCluster : Mining Constant Row Bicluster in Gene Expression Data ». Applied Mechanics and Materials 135-136 (octobre 2011) : 628–33. http://dx.doi.org/10.4028/www.scientific.net/amm.135-136.628.
Texte intégralHu, Zhen, et Raj Bhatnagar. « Mining Low-Variance Biclusters to Discover Coregulation Modules in Sequencing Datasets ». Scientific Programming 20, no 1 (2012) : 15–27. http://dx.doi.org/10.1155/2012/953863.
Texte intégralLiu, Xiangyu, Di Li, Juntao Liu, Zhengchang Su et Guojun Li. « RecBic : a fast and accurate algorithm recognizing trend-preserving biclusters ». Bioinformatics 36, no 20 (11 juillet 2020) : 5054–60. http://dx.doi.org/10.1093/bioinformatics/btaa630.
Texte intégralPanteli, Antiopi, Basilis Boutsinas et Ioannis Giannikos. « On Set Covering Based on Biclustering ». International Journal of Information Technology & ; Decision Making 13, no 05 (septembre 2014) : 1029–49. http://dx.doi.org/10.1142/s0219622014500692.
Texte intégralLi, Yidong, Wenhua Liu, Yankun Jia et Hairong Dong. « A weighted Mutual Information Biclustering algorithm for gene expression data ». Computer Science and Information Systems 14, no 3 (2017) : 643–60. http://dx.doi.org/10.2298/csis170301021y.
Texte intégralZhang, Haokun, Yuanhua Shao, Weijun Chen et Xin Chen. « Identifying Mitochondrial-Related Genes NDUFA10 and NDUFV2 as Prognostic Markers for Prostate Cancer through Biclustering ». BioMed Research International 2021 (22 mai 2021) : 1–15. http://dx.doi.org/10.1155/2021/5512624.
Texte intégralThèses sur le sujet "Bicluter"
Subramanian, Hema. « Summarization Of Real Valued Biclusters ». University of Cincinnati / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1307442728.
Texte intégralFiaux, Patrick O. « Solving Intelligence Analysis Problems using Biclusters ». Thesis, Virginia Tech, 2012. http://hdl.handle.net/10919/31293.
Texte intégralMaster of Science
Banerjee, Abhik. « Discovery of overlapping 1-closed biclusters ». University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1352396960.
Texte intégralGolchin, Maryam. « Bicluster Analysis of Biomedical Data based on Multi-objective Evolutionary Optimization ». Thesis, Griffith University, 2018. http://hdl.handle.net/10072/376812.
Texte intégralThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Info & Comm Tech
Science, Environment, Engineering and Technology
Full Text
Oliveira, Saullo Haniell Galvão de 1988. « On biclusters aggregation and its benefits for enumerative solutions = Agregação de biclusters e seus benefícios para soluções enumerativas ». [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259072.
Texte intégralDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação
Made available in DSpace on 2018-08-27T03:28:44Z (GMT). No. of bitstreams: 1 Oliveira_SaulloHaniellGalvaode_M.pdf: 1171322 bytes, checksum: 5488cfc9b843dbab6d7a5745af1e3d4b (MD5) Previous issue date: 2015
Resumo: Biclusterização envolve a clusterização simultânea de objetos e seus atributos, definindo mo- delos locais de relacionamento entre os objetos e seus atributos. Assim como a clusterização, a biclusterização tem uma vasta gama de aplicações, desde suporte a sistemas de recomendação, até análise de dados de expressão gênica. Inicialmente, diversas heurísticas foram propostas para encontrar biclusters numa base de dados numérica. No entanto, tais heurísticas apresen- tam alguns inconvenientes, como não encontrar biclusters relevantes na base de dados e não maximizar o volume dos biclusters encontrados. Algoritmos enumerativos são uma proposta recente, especialmente no caso de bases numéricas, cuja solução é um conjunto de biclusters maximais e não redundantes. Contudo, a habilidade de enumerar biclusters trouxe mais um cenário desafiador: em bases de dados ruidosas, cada bicluster original se fragmenta em vá- rios outros biclusters com alto nível de sobreposição, o que impede uma análise direta dos resultados obtidos. Essa fragmentação irá ocorrer independente da definição escolhida de co- erência interna no bicluster, sendo mais relacionada com o próprio nível de ruído. Buscando reverter essa fragmentação, nesse trabalho propomos duas formas de agregação de biclusters a partir de resultados que apresentem alto grau de sobreposição: uma baseada na clusteriza- ção hierárquica com single linkage, e outra explorando diretamente a taxa de sobreposição dos biclusters. Em seguida, um passo de poda é executado para remover objetos ou atributos indesejados que podem ter sido incluídos como resultado da agregação. As duas propostas foram comparadas entre si e com o estado da arte, em diversos experimentos, incluindo bases de dados artificiais e reais. Essas duas novas formas de agregação não só reduziram significa- tivamente a quantidade de biclusters, essencialmente defragmentando os biclusters originais, mas também aumentaram consistentemente a qualidade da solução, medida em termos de precisão e recuperação, quando os biclusters são conhecidos previamente
Abstract: Biclustering involves the simultaneous clustering of objects and their attributes, thus defin- ing local models for the two-way relationship of objects and attributes. Just like clustering, biclustering has a broad set of applications, ranging from an advanced support for recom- mender systems of practical relevance to a decisive role in data mining techniques devoted to gene expression data analysis. Initially, heuristics have been proposed to find biclusters, and their main drawbacks are the possibility of losing some existing biclusters and the inca- pability of maximizing the volume of the obtained biclusters. Recently efficient algorithms were conceived to enumerate all the biclusters, particularly in numerical datasets, so that they compose a complete set of maximal and non-redundant biclusters. However, the ability to enumerate biclusters revealed a challenging scenario: in noisy datasets, each true bicluster becomes highly fragmented and with a high degree of overlapping, thus preventing a direct analysis of the obtained results. Fragmentation will happen no matter the boundary condi- tion adopted to specify the internal coherence of the valid biclusters, though the degree of fragmentation will be associated with the noise level. Aiming at reverting the fragmentation, we propose here two approaches for properly aggregating a set of biclusters exhibiting a high degree of overlapping: one based on single linkage and the other directly exploring the rate of overlapping. A pruning step is then employed to filter intruder objects and/or attributes that were added as a side effect of aggregation. Both proposals were compared with each other and also with the actual state-of-the-art in several experiments, including real and artificial datasets. The two newly-conceived aggregation mechanisms not only significantly reduced the number of biclusters, essentially defragmenting true biclusters, but also consistently in- creased the quality of the whole solution, measured in terms of Precision and Recall when the composition of the dataset is known a priori
Mestrado
Engenharia de Computação
Mestre em Engenharia Elétrica
Sun, Maoyuan. « Visual Analytics with Biclusters : Exploring Coordinated Relationships in Context ». Diss., Virginia Tech, 2016. http://hdl.handle.net/10919/72890.
Texte intégralPh. D.
Owens, Clifford Conley. « Mining Truth Tables and Straddling Biclusters in Binary Datasets ». Thesis, Virginia Tech, 2009. http://hdl.handle.net/10919/35745.
Texte intégralMaster of Science
Jin, Ying. « New Algorithms for Mining Network Datasets : Applications to Phenotype and Pathway Modeling ». Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/40493.
Texte intégralPh. D.
Kumar, Lalit. « Scalable Map-Reduce Algorithms for Mining Formal Concepts and Graph Substructures ». University of Cincinnati / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1543996580926452.
Texte intégralSilva, Miguel Miranda Garção da. « User-Specific Bicluster-based Collaborative Filtering ». Master's thesis, 2020. http://hdl.handle.net/10451/48316.
Texte intégralCollaborative Filtering is one of the most popular and successful approaches for Recommender Systems. However, some challenges limit the effectiveness of Collaborative Filtering approaches when dealing with recommendation data, mainly due to the vast amounts of data and their sparse nature. In order to improve the scalability and performance of Collaborative Filtering approaches, several authors proposed successful approaches combining Collaborative Filtering with clustering techniques. In this work, we study the effectiveness of biclustering, an advanced clustering technique that groups rows and columns simultaneously, in Collaborative Filtering. When applied to the classic U-I interaction matrices, biclustering considers the duality relations between users and items, creating clusters of users who are similar under a particular group of items. We propose USBCF, a novel biclustering-based Collaborative Filtering approach that creates user specific models to improve the scalability of traditional CF approaches. Using a realworld dataset, we conduct a set of experiments to objectively evaluate the performance of the proposed approach, comparing it against baseline and state-of-the-art Collaborative Filtering methods. Our results show that the proposed approach can successfully suppress the main limitation of the previously proposed state-of-the-art biclustering-based Collaborative Filtering (BBCF) since BBCF can only output predictions for a small subset of the system users and item (lack of coverage). Moreover, USBCF produces rating predictions with quality comparable to the state-of-the-art approaches.
Livres sur le sujet "Bicluter"
Ismailov, Nariman, Samira Nadzhafova et Aygyun Gasymova. Bioecosystem complexes for the solution of environmental, industrial and social problems (on the example of Azerbaijan). ru : INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1043239.
Texte intégralChapitres de livres sur le sujet "Bicluter"
Shojima, Kojiro. « Bicluster Network Model ». Dans Test Data Engineering, 527–69. Singapore : Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-9986-3_11.
Texte intégralSun, Peng, Jiong Guo et Jan Baumbach. « Complexity of Dense Bicluster Editing Problems ». Dans Lecture Notes in Computer Science, 154–65. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08783-2_14.
Texte intégralGheno, Gloria. « BIBLIOBICLUSTER : A Bicluster Algorithm for Bibliometrics ». Dans IFIP Advances in Information and Communication Technology, 271–82. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79150-6_22.
Texte intégralProtti, Fábio, Maise Dantas da Silva et Jayme Luiz Szwarcfiter. « Applying Modular Decomposition to Parameterized Bicluster Editing ». Dans Parameterized and Exact Computation, 1–12. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11847250_1.
Texte intégralLonardi, Stefano, Wojciech Szpankowski et Qiaofeng Yang. « Finding Biclusters by Random Projections ». Dans Combinatorial Pattern Matching, 102–16. Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27801-6_8.
Texte intégralLafond, Manuel. « Even Better Fixed-Parameter Algorithms for Bicluster Editing ». Dans Lecture Notes in Computer Science, 578–90. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58150-3_47.
Texte intégralOliveira, Saullo, Rosana Veroneze et Fernando J. Von Zuben. « On Bicluster Aggregation and its Benefits for Enumerative Solutions ». Dans Machine Learning and Data Mining in Pattern Recognition, 266–80. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21024-7_18.
Texte intégralSaito, Tatsuya, et Yoshifumi Okada. « Bicluster-Network Method and Its Application to Movie Recommendation ». Dans Advances in Intelligent Systems and Computing, 147–53. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-02821-7_14.
Texte intégralXu, Xiaohua, Ping He, Lin Lu, Yanqiu Xi et Zhoujin Pan. « Finding k-Biclusters from Gene Expression Data ». Dans Lecture Notes in Computer Science, 433–39. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31576-3_55.
Texte intégralMenezes, Lara, et André L. V. Coelho. « Mining Coherent Biclusters with Fish School Search ». Dans Lecture Notes in Computer Science, 573–82. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21524-7_70.
Texte intégralActes de conférences sur le sujet "Bicluter"
P. Pinto-Roa, Diego, Hernán Medina, Federico Román, Miguel García-Torres, Federico Divina, Francisco Gómez-Vela, Félix Morales et al. « Parallel Evolutionary Biclustering of Short-term Electric Energy Consumption ». Dans 2nd International Conference on Machine Learning &Trends (MLT 2021). AIRCC Publishing Corporation, 2021. http://dx.doi.org/10.5121/csit.2021.111110.
Texte intégralSun, Huan, Gengxin Miao et Xifeng Yan. « Noise-Resistant Bicluster Recognition ». Dans 2013 IEEE International Conference on Data Mining (ICDM). IEEE, 2013. http://dx.doi.org/10.1109/icdm.2013.34.
Texte intégralSun, Maoyuan, David Koop, Jian Zhao, Chris North et Naren Ramakrishnan. « Interactive Bicluster Aggregation in Bipartite Graphs ». Dans 2019 IEEE Visualization Conference (VIS). IEEE, 2019. http://dx.doi.org/10.1109/visual.2019.8933546.
Texte intégralAggarwal, Geeta, et Neelima Gupta. « BEMI Bicluster Ensemble Using Mutual Information ». Dans 2013 12th International Conference on Machine Learning and Applications (ICMLA). IEEE, 2013. http://dx.doi.org/10.1109/icmla.2013.65.
Texte intégralOhama, Iku, Takuya Kida et Hiroki Arimura. « Discovering Relevance-Dependent Bicluster Structure from Relational Data ». Dans Twenty-Sixth International Joint Conference on Artificial Intelligence. California : International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/359.
Texte intégralChen, Kuanchung, et Yuh-Jyh Hu. « Bicluster Analysis of Genome-Wide Gene Expression ». Dans 2006 IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology. IEEE, 2006. http://dx.doi.org/10.1109/cibcb.2006.330994.
Texte intégralLiu, Shuyong, Yan Chen, Ming Yang et Rui Ding. « Bicluster Algorithm and Used in Market Analysis ». Dans 2009 Second International Workshop on Knowledge Discovery and Data Mining (WKDD). IEEE, 2009. http://dx.doi.org/10.1109/wkdd.2009.224.
Texte intégralGolchin, Maryam, et Alan Wee-Chung Liew. « Bicluster Detection by Hyperplane Projection and Evolutionary Optimization ». Dans 9th International Conference on Bioinformatics Models, Methods and Algorithms. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0006710000610068.
Texte intégralGolchin, Maryam, et Alan Wee-Chung Liew. « Bicluster detection using strength pareto front evolutionary algorithm ». Dans ACSW '16 : Australasian Computer Science Week. New York, NY, USA : ACM, 2016. http://dx.doi.org/10.1145/2843043.2843050.
Texte intégralLiu, Feng, Huaibei Zhou et Juan Liu. « A Projection and Search Algorithm for the Bicluster Problem ». Dans 2008 International Conference on Computer Science and Software Engineering. IEEE, 2008. http://dx.doi.org/10.1109/csse.2008.1487.
Texte intégral