首页 > 其他分享 >kaggle Open Problems – Single-Cell Perturbations 1st & 2nd place solution summary

kaggle Open Problems – Single-Cell Perturbations 1st & 2nd place solution summary

时间:2023-12-22 23:44:07浏览次数:34  
标签:Problems solution kaggle cell single https 1st com

Leaderboard: https://www.kaggle.com/competitions/open-problems-single-cell-perturbations/leaderboard

2nd

Solution: https://www.kaggle.com/competitions/open-problems-single-cell-perturbations/discussion/458738
Code: https://github.com/Eliorkalfon/single_cell_pb

  1. 使用transformer
  2. target encoding
  3. kmeans改变分布,获得balanced distribution。或者说利用kmeans进行类别均衡

1st

Post: https://www.kaggle.com/competitions/open-problems-single-cell-perturbations/discussion/459258
Code: https://github.com/Jean-KOUAGOU/1st-place-solution-single-cell-pbs

主要是2点:

feature augmentation

  1. 加入cell type text embedding
  2. 加入SMILES的 text embedding
  3. 老生常谈:target encode
  4. 仍然使用one hot
  5. 全部concate起来

ensamble learning

  1. 各个输入模型k-fold后加权平均
  2. 3中不同程度的输入feature,
  3. 寻找3种不同的model arch(最后取其中的1种)
  4. 加权平均(集成学习模型)

标签:Problems,solution,kaggle,cell,single,https,1st,com
From: https://www.cnblogs.com/yonggie/p/17903410.html

相关文章

  • Python hdfs 读取文件报错 Temporary failure in name resolution
    问题背景本人按照菜鸟教程的步骤,在windows系统布置了ubuntu虚拟机环境,并使用centos容器镜像搭建出单节点的hdfs服务。欲使用Pythonhdfsapi测试hdfs服务的功能,遂在ubuntu中编写以下代码准备测试fromhdfsimportClientclient=Client(url='http://172.17.0.3:9870',root=......
  • A. Problemsolving Log
    原题链接结合样例读题1.输入序列代表每一时刻思考的题目2.如果思考的题目时长超过给定值就代表题目解决。综上如果一个字符的出现次数大于给定值就代表解决了这个问题。代码#include<bits/stdc++.h>usingnamespacestd;intmain(){intt;cin>>t;while(t......
  • IPQ8074/IPQ8072 What's the performance difference?|8X8 4X4 High Performance 802.
    IPQ8074/IPQ8072What'stheperformancedifference?|8X84X4HighPerformance802.11axSolutionInthefast-pacedworldofwirelessconnectivity,choosingtherightroutermotherboardcanmakeallthedifferenceinyournetwork'sperformance.Inth......
  • Real-Time Single Image and Video Super-Resolution Using an Efficient Sub-Pixel C
    Real-TimeSingleImageandVideoSuper-ResolutionUsinganEfficientSub-PixelConvolutionalNeuralNetwork*Authors:[[WenzheShi]],[[JoseCaballero]],[[FerencHuszar]],[[JohannesTotz]],[[AndrewP.Aitken]],[[RobBishop]],[[DanielRueckert]],[[Z......
  • RefineNet: Multi-path Refinement Networks for High-Resolution Semantic Segmentat
    RefineNet:Multi-pathRefinementNetworksforHigh-ResolutionSemanticSegmentation*Authors:[[GuoshengLin]],[[AntonMilan]],[[ChunhuaShen]],[[IanReid]]DOI:10.1109/CVPR.2017.549Locallibrary初读印象comment::(RefineNet)一种多路径的用于高分......
  • A Deformable Attention Network for High-Resolution Remote Sensing Images Semanti
    ADeformableAttentionNetworkforHigh-ResolutionRemoteSensingImagesSemanticSegmentation*Authors:[[RenxiangZuo]],[[GuangyunZhang]],[[RongtingZhang]],[[XiupingJia]]DOI:10.1109/TGRS.2021.3119537初读印象comment::(MDANet)提出了可变形注意力,结......
  • A. Constructive Problems
    原题链接思路历程1.一开始我不知道具体该怎么放,于是我按照样例2的顺序手画了一遍。2.然后发现,对于一个n*n的矩形,再放一个格子最大能使其达到(n+1)*(n+1)3.1*1时,放了1个格子,2*2时放了2个格子,由此可以推出放n个格子时最大能达到n*n4.这道题就变成了,找出k使得k*k刚好能覆盖n*m,也就......
  • POLIR-Management-TYPES of decisions{Structured(routine+familiar)Problems: Progra
    Inaverysimplesense,theproblemsmanagersencountercanbeclassifiedas:routineandfamiliar;newandunusual.Inresponse,managerswilluseoneoftwodifferenttypesofdecisions:StructuredProblemsandProgrammedDecisions;UnstructuredP......
  • 【Kaggle】AAAMLP读书笔记 Cat-in-the-dat II (优化)
    本人希望从0开始,自己的Kaggle竞赛12月拿到自己的第一块Kaggle奖牌短期内读完AbhishekThakur的Approaching(Almost)AnyMachineLearningProblem并且发博客记录https://github.com/abhishekkrthakur/approachingalmost12月至少发21篇博客每天保持八小时的学习时间Approachingca......
  • [ARC111F] Do you like query problems?
    题意:给出三个数\(n,m,q\)。你有一个长度为\(n\)的序列\(a\),初始全为为\(0\),你有三种操作:操作\(1\):给出\(l,r,v\),让区间\([l,r]\)对\(v\)取\(\min\)。操作\(2\):给出\(l,r,v\),让区间\([l,r]\)对\(v\)取\(\max\)。操作\(3\),给出\(l,r\),求区间和,将其累加进......