Category-based infidelity bounded queries over unstructured data streams

IEEE Transactions on Knowledge and Data Engineering

Volumn 25, Issue 11, 2013, Pages 2448-2462

  Bhide, Manish ^a   Ramamritham, Krithi ^b  

^a IBM RESEARCH INDIA   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

category based query; Continuous query; data stream; threshold queries

Indexed keywords

CATEGORY-BASED QUERY; CONSTRAINED MINIMIZATION PROBLEM; CONTINUOUS QUERIES; DATA STREAM; DATA-INTENSIVE APPLICATION; EXPERIMENTAL EVALUATION; MULTIPROCESSOR SCHEDULING ALGORITHMS; THRESHOLD QUERIES;

ALGORITHMS; DATA COMMUNICATION SYSTEMS; QUERY PROCESSING;

METADATA;

EID: 84880655738     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2012.200     Document Type: Article

References (22)

1. E.L. Allwein, R.E. Schapire, and Y. Singer, "Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers," J. Machine Learning Research, vol. 1, pp. 113-141, 2000. (Pubitemid 33738778)
2. F. Alvanaki, S. Michel, K. Ramamritham, and G. Weikum, "En Blogue-Emergent Topic Detection in Web 2.0 Stream," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2011.
3. M. Agarwal, K. Ramamritham, and M. Bhide, "Real Time Discovery of Dense Clusters in Highly Dynamic Graphs," Proc. VLDB Endowment, vol. 5, pp. 980-991, 2012.
4. M. Bhide, V. Chakravarthy, K. Ramamritham, and P. Roy, "Keyword Search over Dynamic Categorized Information," Proc. Int'l Conf. Data Eng. (ICDE), 2009.
5. M. Bhide and K. Ramamritham, Algorithms Used in Caicos, www.cse.iitb.ac.in/krithi/papers/CaicosAlgo.pdf, 2013.
6. M. Bhide, K. Ramamritham, and M. Agrawal, "Efficient Execution of Continuous Infidelity Bounded Queries over Multi-Source Streaming Data," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), 2007.
7. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004.
8. D. Hand and K. Yu, "Idiot's Bayes-Not So Stupid After All" Int'l Statistical Rev., vol. 69, pp. 385-398, 2001.
9. J.A. Hartigan, Clustering Algorithms. John Wiley and Sons, Inc., 1975.
10. M.A. Hearst, "Clustering versus Faceted Categories for Information Exploration," Comm. ACM, vol. 49, pp. 59-61, Apr. 2006.
11. E. Lawler, J. Lenstra, A. Rinnooy Kan, and D. Shmoys, "Sequencing and Scheduling: Algorithms and Complexity," Handbooks in Operations Research and Management Science, Elsevier, 1989.
12. W. Liu, Y. Zhou, and F. Ren, "Text Clustering Based on the User Search Intention," Physics Procedia, vol. 22, pp. 339-346, 2011.
13. C. Olston and M. Najork, "Web Crawling," J. Foundations and Trends in Information Retrieval, vol. 4, pp. 175-246, 2010.
14. L. Qin, J. Xu Yu, L. Chang, and Y. Tao, "Scalable Keyword Search on Large Data Streams," Proc. IEEE 25th Int'l Conf. Data Eng. (ICDE), 2009.
15. S.E. Robertson, S. Walker, S. Jones, and M. Gatford, "Okapi at TREC-3," Proc. Third Text Retrieval Conf., 1994.
16. G. Salton and C. Yang, "On the Specification of Term Values in Automatic Indexing," J. Documentation, vol. 29, pp. 351-372, 1973.
17. D. Sifry, State of the Blogosphere, http://technorati.com/weblog/2006/04/ 96.html, 2013.
18. C. Silverstein, M. Henzinger, and H. Marais, "Analysis of a Very Large Altavista Query Log," Technical Report 1998014, Compaq Systems Research Center, 1998.
19. G. Tsoumakas, I. Katakis, and I. Vlahavas, "Mining Multi-Label Data," Data Mining and Knowledge Discovery Handbook, Springer, 2010.
20. P. Wilmott and S. Howinson, and J. Dewyne, The Mathematics of Financial Derivatives. Cambridge Univ. Press, 1995.
21. M. Wright, Interior Methods for Constrained Optimization. Cambridge Univ. Press, 1992.
22. M. Zang and Z. Zhou, "ML-KNN: A Lazy Learning Approach to Multi-Label Learning," J. Pattern Recognition, vol. 40, pp. 2038-2048, 2007. (Pubitemid 46497248)