BibTeX records: Sushant S. Khopkar

• > Home > Persons > Sushant S. Khopkar

@article{DBLP:journals/ecra/KhopkarN17,
  author       = {Sushant S. Khopkar and
                  Alexander G. Nikolaev},
  title        = {Predicting long-term product ratings based on few early ratings and
                  user base analysis},
  journal      = {Electron. Commer. Res. Appl.},
  volume       = {21},
  pages        = {38--49},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.elerap.2016.12.002},
  doi          = {10.1016/J.ELERAP.2016.12.002},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ecra/KhopkarN17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/snam/KhopkarNT16,
  author       = {Sushant S. Khopkar and
                  Rakesh Nagi and
                  Gregory Tauer},
  title        = {A penalty box approach for approximation betweenness and closeness
                  centrality algorithms},
  journal      = {Soc. Netw. Anal. Min.},
  volume       = {6},
  number       = {1},
  pages        = {4:1--4:13},
  year         = {2016},
  url          = {https://doi.org/10.1007/s13278-015-0308-7},
  doi          = {10.1007/S13278-015-0308-7},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/snam/KhopkarNT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/snam/KhopkarNNB14,
  author       = {Sushant S. Khopkar and
                  Rakesh Nagi and
                  Alexander G. Nikolaev and
                  Vaibhav Bhembre},
  title        = {Efficient algorithms for incremental all pairs shortest paths, closeness
                  and betweenness in social network analysis},
  journal      = {Soc. Netw. Anal. Min.},
  volume       = {4},
  number       = {1},
  pages        = {220},
  year         = {2014},
  url          = {https://doi.org/10.1007/s13278-014-0220-6},
  doi          = {10.1007/S13278-014-0220-6},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/snam/KhopkarNNB14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fusion/DateGKNS13,
  author       = {Ketan Date and
                  Geoff A. Gross and
                  Sushant S. Khopkar and
                  Rakesh Nagi and
                  Kedar Sambhoos},
  title        = {Data association and graph analytical processing of hard and soft
                  intelligence data},
  booktitle    = {Proceedings of the 16th International Conference on Information Fusion,
                  {FUSION} 2013, Istanbul, Turkey, July 9-12, 2013},
  pages        = {404--411},
  publisher    = {{IEEE}},
  year         = {2013},
  url          = {https://ieeexplore.ieee.org/document/6641307/},
  timestamp    = {Mon, 09 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fusion/DateGKNS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/asunam/KhopkarNN12,
  author       = {Sushant S. Khopkar and
                  Rakesh Nagi and
                  Alexander G. Nikolaev},
  title        = {An Efficient Map-Reduce Algorithm for the Incremental Computation
                  of All-Pairs Shortest Paths in Social Networks},
  booktitle    = {International Conference on Advances in Social Networks Analysis and
                  Mining, {ASONAM} 2012, Istanbul, Turkey, 26-29 August 2012},
  pages        = {1144--1148},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/ASONAM.2012.197},
  doi          = {10.1109/ASONAM.2012.197},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/asunam/KhopkarNN12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}