default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVinjamuri Janaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j9]Vangipuram Radhakrishna
, Gali Suresh Reddy, Puligadda Veereswara Kumar, Vinjamuri Janaki:
Challenge Paper: The Vision for Time Profiled Temporal Association Mining. ACM J. Data Inf. Qual. 13(2): 12:1-12:8 (2021)- 2020
- [j8]Vangipuram Radhakrishna, Gunupudi Rajesh Kumar, Puligadda Veereswara Kumar, Vinjamuri Janaki:
A machine learning approach for imputation and anomaly detection in IoT environment. Expert Syst. J. Knowl. Eng. 37(5) (2020)
2010 – 2019
- 2019
- [j7]Vangipuram Radhakrishna, Puligadda Veereswara Kumar, Vinjamuri Janaki:
GANDIVA: Temporal Pattern Tree for Similarity Profiled Association Mining. Int. J. Inf. Technol. Web Eng. 14(4): 1-18 (2019) - [j6]Vangipuram Radhakrishna, Shadi A. Aljawarneh, Puligadda Veereswara Kumar, Vinjamuri Janaki:
ASTRA - A Novel interest measure for unearthing latent temporal associations and trends through extending basic gaussian membership function. Multim. Tools Appl. 78(4): 4217-4265 (2019) - 2018
- [j5]Vangipuram Radhakrishna, Shadi A. Aljawarneh, Puligadda Veereswara Kumar, Vinjamuri Janaki:
A novel fuzzy similarity measure and prevalence estimation approach for similarity profiled temporal association pattern mining. Future Gener. Comput. Syst. 83: 582-595 (2018) - [j4]Vangipuram Radhakrishna, Puligadda Veereswara Kumar, Vinjamuri Janaki:
SRIHASS - a similarity measure for discovery of hidden time profiled temporal associations. Multim. Tools Appl. 77(14): 17643-17692 (2018) - 2017
- [j3]Shadi A. Aljawarneh, Vangipuram Radhakrishna, Puligadda Veereswara Kumar, Vinjamuri Janaki:
G-SPAMINE: An approach to discover temporal association patterns and trends in internet of things. Future Gener. Comput. Syst. 74: 430-443 (2017) - 2016
- [j2]Vangipuram Radhakrishna, Puligadda Veereswara Kumar, Vinjamuri Janaki:
A Novel Similar Temporal System Call Pattern Mining for Efficient Intrusion Detection. J. Univers. Comput. Sci. 22(4): 475-493 (2016) - [c2]Vangipuram Radhakrishna, Puligadda Veereswara Kumar, Vinjamuri Janaki:
A Single Database Scan Approach for Mining Temporally Similar Association Patterns. ICTCS 2016: 77:1-77:6 - [c1]Vangipuram Radhakrishna, Puligadda Veereswara Kumar, Vinjamuri Janaki:
Mining Outlier Temporal Association Patterns. ICTCS 2016: 105:1-105:6 - [i1]Vangipuram Radhakrishna, Puligadda Veereswara Kumar, Vinjamuri Janaki:
A Novel Approach for Mining Similarity Profiled Temporal Association Patterns. CoRR abs/1604.05272 (2016) - 2014
- [j1]Sadanandam Manchala, V. Kamakshi Prasad, Vinjamuri Janaki:
GMM based language identification system using robust features. Int. J. Speech Technol. 17(2): 99-105 (2014)
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-08-05 20:21 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:
