ODMCA: An adaptive data mining control algorithm in multicarrier networks

Computer Communications

Volumn 32, Issue 3, 2009, Pages 560-567

  Xiong, Naixue ^a   Yang, Laurence T ^b   Li, Yingshu ^a  

^a GEORGIA STATE UNIVERSITY   (United States)

^b ST FRANCIS XAVIER UNIVERSITY   (Canada)

Author keywords

Control theory; Data mining; Data streams; Multicarrier communications; PID controller

Indexed keywords

ADAPTIVE ALGORITHMS; CARRIER COMMUNICATION; COMMUNICATION; COMMUNICATION SYSTEMS; CONTROL SYSTEM ANALYSIS; CONTROL THEORY; CONTROLLERS; DATA MINING; DATA REDUCTION; ELECTRIC CONTROL EQUIPMENT; FADING (RADIO); FADING CHANNELS; FOURIER TRANSFORMS; INFORMATION MANAGEMENT; MULTICARRIER MODULATION; PROGRAMMING THEORY; PROPORTIONAL CONTROL SYSTEMS; STABILITY CRITERIA; SYSTEM STABILITY; SYSTEM THEORY; THREE TERM CONTROL SYSTEMS; TRANSMITTERS; TWO TERM CONTROL SYSTEMS;

ADAPTIVE CAPABILITIES; ADAPTIVE CONTROLS; ADAPTIVE DATA MININGS; COMPUTATION MODELS; CONTROL LOOPS; CONTROL PARAMETERS; DATA STREAMING; DATA STREAMS; DELAY SPREADS; DYNAMIC DATUM; EXPLICIT RATES; FAST RESPONSE; GENERAL NETWORKS; HIGH DATA RATES; LIMITED MEMORIES; MAIN MEMORIES; MASSIVE DATA STREAMS; MINING CONTROLS; MULTI CARRIERS; MULTICARRIER COMMUNICATION SYSTEMS; MULTICARRIER COMMUNICATIONS; NETWORK STABILITIES; NETWORK TRANSMISSIONS; ON-LINE DATUM; PID CONTROLLER; PROCESS DYNAMICS; RATE ALLOCATIONS; SENDING RATES; SIMULATION RESULTS; SINGLE PASS; STABILITY TESTS; STEADY STATE OSCILLATIONS; TERMINAL NODES; THEORETICAL ASPECTS; Z TRANSFORMATIONS;

ADAPTIVE CONTROL SYSTEMS;

EID: 59149102666     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2008.08.026     Document Type: Article

References (48)

1. B. Babcock, S. Babu, M. Datar, R. Motwani, J. Widom, Models and issues in data stream systems, in: Proceedings of the 21st ACM Symposium on Principles of Database Systems (PODS 2002), Madison, WI, June 2002.
2. Alon N., Matias Y., and Szegedy M. The space complexity of approximating the frequency moments. Proceedings of the ACM Symposium Theory of Computing (STOC) (1996) 20-29
3. H.-F. Li, S.-Y. Lee, Single-pass algorithms for mining frequency change patterns with limited space in evolving append-only and dynamic transaction data streams, Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commence and e-Service (EEE'04), 2004, pp. 215-222.
4. Feigenbaum J., Kannan S., Strauss M., and Viswanathan M. Testing and spot-checking of data streams. Proceedings of the ACM-SIAM Symposium Discrete Algorithms (SODA) (2000) 165-174
5. Indyk P. Stable distributions, pseudorandom generators, embeddings and data stream computation. Proceedings of the IEEE Symposium Foundations of Computer Science (FOCS) (2000) 189-197
6. Guha S., Mishra N., Motwani R., and O'Callaghan L. Clustering data streams. Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) (2000) 359-366
7. N. Alon, P. Gibbons, Y. Matias, M. Szegedy, Tracking join and self-join sizes in limited storage, in: Proceedings of the Eighteenth ACM Symposium on Principles of the Database Systems (PODS'99), 1999, pp. 10-20.
8. J.M. Hellerstein, P.J. Haas, H. Wang, Online aggregation, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1997, pp. 171-182.
9. R. Agrawal, A. Swami, A one-pass space-ecient algorithm for finding quantiles, in: Proceedings of COMAD, Pune, India, December 1995.
10. Manku G., Rajagopalan S., and Lindsay B. Random sampling techniques for space efficient online computation of order statistics of large datasets. Proceedings of the ACM SIGMOD (1999)
11. Gilbert A., Kotidis Y., Muthukrishnan S., and Strauss M. How to summarize the universe: dynamic maintenance of quantiles. Proceedings of the Very Large Data Bases Conference (2002) 454-465
12. Gehrke J., Korn F., and Srivastava D. On computing correlated aggregates over continual data streams. Proceedings of the ACM SIGMOD Conference (2001) 13-24
13. Ganti V., Gehrke J., and Ramakrishnan R. Mining very large databases. Computer 32 8 (1999) 38-45
14. M. Datar, A. Ginois, P. Indyk, R. Motwani, Maintaining stream statistics over sliding windows, in: Proceedings of 13th Annual ACM-SIAM Symposium On Discrete Algorithms, January 2002.
15. Babu S., and Widom J. Continuous queries over data streams. SIGMOD Record 30 3 (2001) 109-120
16. Madden S., and Franklin M.J. Fjording the stream: an architecture for queries over streaming sensor data. Proceedings of the International Conference on Data Engineering (2002)
17. Gilbert A., Kotidis Y., Muthukrishnan S., and Strauss M. Surfing wavelets on streams: one-pass summaries for approximate aggregate queries. Proceedings of the VLDB Conference (2001) 79-88
18. Chen Y., Dong G., Han J., Wah B.W., and Wang J. Multi-dimensional regression analysis of time series data streams. VLDB'02, Hong Kong, China Aug (2002)
19. C.C. Aggarwal, J. Han, J. Wang, P.S. Yu, A framework for clustering evolving data streams, in: Proceedings of the 29th VLDB Conference, Berlin, Germany, 2003.
20. B.K. Yi, N. Sidiropoulos, T. Johnson, H.V. Jagadish, C. Faloutsos, A. Biliris, Online data mining for co-evolving time sequences, in: Proceedings of the 16th International Conference on Data Engineering, 2000, pp. 13-22.
21. P. Domingos, G. Hulten, Mining high-speed data streams, in: Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining (KDD'00), August 2000, pp. 71-80.
22. G. Hulten, L. Spencer, P. Domingos, Mining time-changing data streams, in: Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining (KDD'01), August 2001, pp. 97-106.
23. Alon N., Matias Y., and Szegedy M. The space complexity of approximating the frequency moments. JCSS: Journal of Computer and System Sciences 58 (1999)
24. Feigenbaum J., Kannan S., Strauss M., and Viswanathan M. An approximate L1-difference algorithm for massive data streams (extended abstract). FOCS: IEEE Symposium on Foundations of Computer Science (FOCS) (1999)
25. M. Charilar, K. Chen, M. Farach-Colton, Finding frequent items in data streams, in: Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), 2002, pp. 693-703.
26. E. Demaine, A. Lpez-Ortiz, J.I. Munro, Frequent estimation of internet packet streams with limited space, in: Proceedings of the 10th Annual European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science, 2002, pp.348-360.
27. Karp R., Paradimitriou C., and Shenker S. A simple algorithm for finding elements in sets and bags. ACM Transactions on Database Systems (2003)
28. Cormode G., and Muthukrishnan S. What's hot and what's not: tracking most frequent items dynamically. PODS'03 (2003) June
29. G. Dong, J. Li, Efficient mining of emerging patterns: Discovering trends and differences, in: Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining (KDD'99), August 1999, pp. 43-52.
30. Ganti V., Gehrke J., and Ramakrishnan R. A framework for measuring changes in data characteristics. PODS'99 (1999) 126-137
31. Ganti V., Gehrke J., and Ramakrishnan R. Mining data streams under block evolution. SIGKDD Explorations 3 2 (2002) 1-10
32. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Moteani, J.D. Ullman, Computing iceberg queries efficiently, in: Proceedings of the 24th International Conference on Very Large Data Bases, August 1998, pp. 299-310.
33. B. Babcock, C. Olston, Distributed top-k monitoring, in: Proceedings of ACM SIGMOD, 2003.
34. P.B. Gibbons, Y. Matias, Synopsis data structures for massive data sets, in: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1999.
35. A. Gilbert, Y. Kotidis, S. Muthukrishnan, M. Strauss, QuickSAND: quick summary and analysis of network data, DIMACS Technical Report 2001-43, November 2001.
36. http://www-db.standford.edu/stream.
37. Zhang X., Shin K.G., Saha D., and Kandlur D.D. Scalable flow control for multicast ABR services in ATM networks. IEEE/ACM Transactions on Networking 10 1 (2002) 67-85
38. Y. He, N. Xiong, Y. Yang, Data transmission rate control in computer networks using neural predictive networks, The 2004 International Symposium on Parallel Processing and Applications (ISPA 2004), LNCS 3358, 2004, pp. 875-887.
39. Barmish B.R. New tools for robustness of linear systems (1994), MacMillan, New York
40. S. Shi, M. Waldvogel, A rate-based end-to-end multicast congestion control protocol, in: Proceedings of Fifth IEEE Symposium on Computers and Communications (ISCC 2000), 2000.
41. Tan L., Pugh A.C., and Yin M. Rate-based congestion control in ATM switching networks using a recursive digital filter. Control Engineering Practice (Special Issue on Control Methods for Telecommunication Networks) 11 10 (2003) 1171-1181
42. Tan L., Yang Y., Lin C., Xiong N., and Zukerman M. Scalable parameter tuning for AVQ. IEEE Communications Letters 9 1 (2005)
43. Tureli U., Honan P., and Liu H. Low complexity nonlinear least squares carrier offset estimator for OFDM: identifiability, diversity and performance. IEEE Transactions on Signal Processing 52 9 (2004) 2441-2452
44. Chen Y., Aktas E., and Tureli U. Optimal space-frequency group codes for MIMO-OFDM system. IEEE Transactions on Communications 3 54 (2006) 553-562
45. Cao Z., Tureli U., and Yao Y.D. Low complexity orthogonal spectral signal reconstruction for generalized OFDMA uplink with frequency synchronization errors. IEEE Transactions on Vehicular Technology 3 56 (2007) 1143-1154
46. Tsai P., Kang H., and Chiueh T. Design of a baseband transceiver for multicarrier CDMA communications. EURASIP Journal on Applied Signal Processing 11 (2005) 1645-1655
47. Leung C., and Liu J. Multimedia data mining and searching through dynamic index evolution. International Conference on Visual Information Systems (Visual07) (2007) 298-309
48. Luo H., Fan J., Satoh S., and Xue X. Mining large-scale news video database via knowledge visualization. International Conference on Visual Information Systems (Visual07) (2007) 254-266