default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShuchu Han
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i4]Shuchu Han, Alexandru Niculescu-Mizil:
Supervised Feature Subset Selection and Feature Ranking for Multivariate Time Series without Feature Extraction. CoRR abs/2005.00259 (2020)
2010 – 2019
- 2019
- [j3]Pengfei Xu, Shuchu Han
, Hao Huang, Hong Qin:
Redundant features removal for unsupervised spectral feature selection algorithms: an empirical study based on nonparametric sparse feature graph. Int. J. Data Sci. Anal. 8(1): 77-93 (2019) - 2017
- [c10]Shuchu Han, Yifan Hu, Steven Skiena, Baris Coskun, Meizhu Liu, Hong Qin, Jaime Perez:
Generating Look-alike Names For Security Challenges. AISec@CCS 2017: 57-67 - [c9]Junting Ye, Shuchu Han, Yifan Hu, Baris Coskun, Meizhu Liu, Hong Qin, Steven Skiena:
Nationality Classification Using Name Embeddings. CIKM 2017: 1897-1906 - [i3]Shuchu Han, Hao Huang, Hong Qin:
Automatically Redundant Features Removal for Unsupervised Feature Selection via Sparse Feature Graph. CoRR abs/1705.04804 (2017) - [i2]Junting Ye, Shuchu Han, Yifan Hu, Baris Coskun, Meizhu Liu, Hong Qin, Steven Skiena:
Nationality Classification Using Name Embeddings. CoRR abs/1708.07903 (2017) - 2016
- [j2]Shuchu Han, Hong Qin:
A greedy algorithm to construct sparse graph by using ranked dictionary. Int. J. Data Sci. Anal. 2(3-4): 131-143 (2016) - [c8]Shuchu Han, Hong Qin:
Structure Aware L1 Graph for Data Clustering. AAAI 2016: 4214-4215 - [c7]Shuchu Han, Hong Qin:
A Greedy Algorithm to Construct L1 Graph with Ranked Dictionary. PAKDD (2) 2016: 309-321 - 2015
- [c6]Shuchu Han, Hao Huang, Hong Qin, Dantong Yu:
Locality-preserving L1-graph and its application in clustering. SAC 2015: 813-818 - [c5]Hau Chan, Shuchu Han, Leman Akoglu:
Where Graph Topology Matters: The Robust Subgraph Problem. SDM 2015: 10-18 - [i1]Hau Chan, Shuchu Han, Leman Akoglu:
Where Graph Topology Matters: The Robust Subgraph Problem. CoRR abs/1501.01939 (2015) - 2014
- [c4]Shuchu Han, Hong Qin, Dantong Yu:
An Improved Ratio-Based (IRB) Batch Effects Removal Algorithm for Cancer Data in a Co-Analysis Framework. BIBE 2014: 212-219 - 2011
- [j1]Shuchu Han, Jiazhi Xia, Ying He:
Constructing hexahedral shell meshes via volumetric polycube maps. Comput. Aided Des. 43(10): 1222-1233 (2011) - 2010
- [c3]Jiazhi Xia, Ying He, Shuchu Han, Chi-Wing Fu, Feng Luo, Xianfeng Gu:
Parameterization of Star-Shaped Volumes Using Green's Functions. GMP 2010: 219-235 - [c2]Shuchu Han, Jiazhi Xia, Ying He:
Hexahedral shell mesh construction via volumetric polycube map. Symposium on Solid and Physical Modeling 2010: 127-136 - [c1]Jiazhi Xia, Ying He, Xiaotian Yin, Shuchu Han, Xianfeng Gu:
Direct-Product Volumetric Parameterization of Handlebodies via Harmonic Fields. Shape Modeling International 2010: 3-12
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
