default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSiddharth Dawar
Refine list
refinements active!
zoomed in on 13 of 13 records
view refined list in
export refined list as
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2020 – today
- 2021
[j3]Amit Verma, Siddharth Dawar
, Raman Kumar, Shamkant B. Navathe, Vikram Goyal:
High-utility and diverse itemset mining. Appl. Intell. 51(7): 4649-4663 (2021)- [c6]Siddharth Dawar, Vikram Goyal, Debajyoti Bera:
SMIM Framework to Generalize High-Utility Itemset Mining. ADMA 2021: 3-15 - no results
2010 – 2019
- 2019
- [i4]Siddharth Dawar, Vikram Goyal, Debajyoti Bera:
A one-phase tree-based algorithm for mining high-utility itemsets from a transaction database. CoRR abs/1911.07151 (2019) - [i3]Anuj Shanker Saxena, Siddharth Dawar, Vikram Goyal, Debajyoti Bera:
Mining Top-k Trajectory-Patterns from Anonymized Data. CoRR abs/1912.01861 (2019) - 2018
- [i2]Siddharth Dawar, Debajyoti Bera, Vikram Goyal:
High-utility itemset mining for subadditive monotone utility functions. CoRR abs/1812.07208 (2018) - 2017
- [j2]Siddharth Dawar, Vikram Goyal, Debajyoti Bera:
A hybrid framework for mining high-utility itemsets in a sparse transaction database. Appl. Intell. 47(3): 809-827 (2017) - [j1]Siddharth Dawar, Veronica Sharma, Vikram Goyal:
Mining top-k high-utility itemsets from a data stream under sliding window model. Appl. Intell. 47(4): 1240-1255 (2017) - 2016
- [c5]Sonam Rathore, Siddharth Dawar, Vikram Goyal, Dhaval Patel:
Top-K High Utility Episode Mining from a Complex Event Sequence. COMAD 2016: 56-63 - [c4]Jerry Chun-Wei Lin, Lu Yang, Philippe Fournier-Viger, Siddharth Dawar, Vikram Goyal, Ashish Sureka, Bay Vo:
A More Efficient Algorithm to Mine Skyline Frequent-Utility Patterns. ICGEC 2016: 127-135 - 2015
- [c3]Ruchita Bansal, Siddharth Dawar, Vikram Goyal:
An Efficient Algorithm for Mining High-Utility Itemsets with Discount Notion. BDA 2015: 84-98 - [c2]Vikram Goyal, Siddharth Dawar, Ashish Sureka:
High Utility Rare Itemset Mining over Transaction Databases. DNIS 2015: 27-40 - [c1]Siddharth Dawar, Vikram Goyal:
UP-Hist Tree: An Efficient Data Structure for Mining High Utility Patterns from Transaction Databases. IDEAS 2015: 56-61 - [i1]Siddharth Dawar, Vikram Goyal, Debajyoti Bera:
Efficient Reverse k Nearest Neighbor evaluation for hierarchical index. CoRR abs/1506.04867 (2015) - no results
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.
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.
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.
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 21:25 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:
