![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Tanay Kumar Saha
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c11]Xin Dong, Tanay Kumar Saha, Ke Zhang, Joel R. Tetreault, Alejandro Jaimes, Gerard de Melo:
Temporal Event Reasoning Using Multi-source Auxiliary Learning Objectives. ECIR (2) 2022: 102-110 - [c10]Yuwei Cao, William Groves, Tanay Kumar Saha, Joel R. Tetreault, Alejandro Jaimes, Hao Peng, Philip S. Yu:
XLTime: A Cross-Lingual Knowledge Transfer Framework for Temporal Expression Extraction. NAACL-HLT (Findings) 2022: 1931-1942 - [i9]Yuwei Cao, William Groves, Tanay Kumar Saha, Joel R. Tetreault, Alex Jaimes, Hao Peng, Philip S. Yu:
XLTime: A Cross-Lingual Knowledge Transfer Framework for Temporal Expression Extraction. CoRR abs/2205.01757 (2022) - 2021
- [c9]Evangelia Spiliopoulou, Tanay Kumar Saha, Joel R. Tetreault, Alejandro Jaimes:
A Novel Framework for Detecting Important Subevents from Crisis Events via Dynamic Semantic Graphs. W-NUT 2021: 249-259 - [i8]Sanghamitra Dutta, Liang Ma, Tanay Kumar Saha, Di Lu, Joel R. Tetreault, Alex Jaimes:
GTN-ED: Event Detection Using Graph Transformer Networks. CoRR abs/2104.15104 (2021) - 2020
- [i7]Swati Padhee, Tanay Kumar Saha, Joel R. Tetreault, Alejandro Jaimes:
Clustering of Social Media Messages for Humanitarian Aid Response during Crisis. CoRR abs/2007.11756 (2020)
2010 – 2019
- 2019
- [j4]Tanay Kumar Saha
, Ataur Katebi, Wajdi Dhifli
, Mohammad Al Hasan:
Discovery of Functional Motifs from the Interface Region of Oligomeric Proteins Using Frequent Subgraph Mining. IEEE ACM Trans. Comput. Biol. Bioinform. 16(5): 1537-1549 (2019) - [j3]Tianchong Gao
, Wei Peng, Devkishen Sisodia, Tanay Kumar Saha
, Feng Li, Mohammad Al Hasan:
Android Malware Detection via Graphlet Sampling. IEEE Trans. Mob. Comput. 18(12): 2754-2767 (2019) - 2018
- [i6]Mahmudur Rahman, Tanay Kumar Saha, Mohammad Al Hasan, Kevin S. Xu, Chandan K. Reddy:
DyLink2Vec: Effective Feature Representation for Link Prediction in Dynamic Networks. CoRR abs/1804.05755 (2018) - [i5]Tanay Kumar Saha, Thomas Williams, Mohammad Al Hasan, Shafiq R. Joty, Nicholas K. Varberg:
Models for Capturing Temporal Smoothness in Evolving Networks for Learning Latent Representation of Nodes. CoRR abs/1804.05816 (2018) - 2017
- [c8]Tanay Kumar Saha, Shafiq R. Joty, Naeemul Hassan
, Mohammad Al Hasan:
Regularized and Retrofitted models for Learning Sentence Representation with Context. CIKM 2017: 547-556 - [c7]Tanay Kumar Saha
, Shafiq R. Joty
, Mohammad Al Hasan
:
Con-S2V: A Generic Framework for Incorporating Extra-Sentential Context into Sen2Vec. ECML/PKDD (1) 2017: 753-769 - 2016
- [c6]Wei Peng, Tianchong Gao, Devkishen Sisodia, Tanay Kumar Saha
, Feng Li
, Mohammad Al Hasan:
ACTS: Extracting Android App topologiCal signature through graphleT Sampling. CNS 2016: 37-45 - [i4]Tanay Kumar Saha, Mourad Ouzzani, Hossam M. Hammady, Ahmed K. Elmagarmid:
A large scale study of SVM based methods for abstract screening in systematic reviews. CoRR abs/1610.00192 (2016) - [i3]Tanay Kumar Saha, Shafiq R. Joty, Naeemul Hassan, Mohammad Al Hasan:
Dis-S2V: Discourse Informed Sen2Vec. CoRR abs/1610.08078 (2016) - 2015
- [j2]Tanay Kumar Saha
, Mohammad Al Hasan:
FS3: A sampling based method for top-k frequent subgraph mining. Stat. Anal. Data Min. 8(4): 245-261 (2015) - [j1]Tanay Kumar Saha
, Baichuan Zhang, Mohammad Al Hasan:
Name disambiguation from link data in a collaboration graph using temporal and topological features. Soc. Netw. Anal. Min. 5(1): 11:1-11:14 (2015) - [c5]Tanay Kumar Saha
, Mohammad Al Hasan, Chandler Burgess, Md. Ahsan Habib, Jeff Johnson:
Batch-mode active learning for technology-assisted review. IEEE BigData 2015: 1134-1143 - [c4]Tanay Kumar Saha
, Mohammad Al Hasan:
Finding Network Motifs Using MCMC Sampling. CompleNet 2015: 13-24 - 2014
- [c3]Baichuan Zhang, Tanay Kumar Saha
, Mohammad Al Hasan:
Name disambiguation from link data in a collaboration graph. ASONAM 2014: 81-84 - [c2]Tanay Kumar Saha
, Mohammad Al Hasan:
FS3: A sampling based method for top-k frequent subgraph mining. IEEE BigData 2014: 72-79 - [i2]Baichuan Zhang, Tanay Kumar Saha, Mohammad Al Hasan:
Name Disambiguation from link data in a collaboration graph. CoRR abs/1406.5162 (2014) - [i1]Tanay Kumar Saha, Mohammad Al Hasan:
FS^3: A Sampling based method for top-k Frequent Subgraph Mining. CoRR abs/1409.1152 (2014) - 2012
- [c1]Jesun Sahariar Firoz, M. Sohel Rahman
, Tanay Kumar Saha
:
Bee algorithms for solving DNA fragment assembly problem with noisy and noiseless data. GECCO 2012: 201-208
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-08 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint