Matching and Tracking Technique Based on Time Frequency Dictionary

Rong Hua Lu

doi:10.4028/www.scientific.net/AMM.513-517.2355

Paper Titles

Feedback System Design of Architectural Planning Based on Diversified Hot Mining Algorithm
p.2334

Spatial Vector Data Indexing Network Clustered Mode Based on P2P
p.2339

Study on the Optimization of Complex Computer Network Language Based on TEI Model
p.2345

Research on the Cloud Computing Storage Privacy Preserving Based on MB-Tree Dynamic Access Model
p.2350

Matching and Tracking Technique Based on Time Frequency Dictionary
p.2355

Research on Analytical Model of Network Transmission Based on Topological Structure of Logical Layer
p.2360

Algorithm Study on Physical Adaptive Regulation Based on BP Neural Network
p.2364

Simulation Analysis on Feedback Model of Physical Optimization Based on Artificial Neural Network
p.2369

Improvement and Simulation of Artificial Intelligence Algorithm in Special Movements
p.2374

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517Matching and Tracking Technique Based on Time...

Matching and Tracking Technique Based on Time Frequency Dictionary

Abstract:

With the change of internet technology and the coming of information explosion, the mass of information can meet the needs of people searching in a certain extent. But it also caused information loss and spread etc.. The traditional solution is using keyword query of search engine to realize information, the information classified. But this method is based on the hot information of mass, it doesnt have certain timeliness. Based on this, this paper improves TFIDF model, put forward Web high precision matching tracking technique based on time frequency. It can carry out a full range of filtration for web information, is simple and effective to search the information which the customer need, with a high timeliness. It provides a theoretical basis for the research of web information filtering system.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

2355-2359

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.2355

Citation:

Cite this paper

Online since:

February 2014

Authors:

Rong Hua Lu*

Keywords:

High Precision Matching, Internet, Search Engine, TFIDF Model, Time Frequency, Web Information Filtering

Export:

RIS, BibTeX

Price:

Permissions:

Request Permissions

* - Corresponding Author

References

[1] Ting Liu, Bing QIn. Information retrieval practice of search engine [M]. Beijing: China Machine Press, 2010: 144-147.

Google Scholar

[2] Qing Wang, Weihua Zhuang. Query suggestion based on the TF-IQF model [J]. Computer engineering, 2010, 36 (21): 78-80.

Google Scholar

[3] Yanan Li, Sheng Xu, Bin Wang. Chinese query recommendation based on weighted SimRank [J]. Journal of Chinese information processing, 2010, 24 (3): 4-9.

Google Scholar

[4] Chunguang Ma. Query expansion algorithm research based on user interest [D]. Harbin Engineering University, 2011: 46-47.

Google Scholar

[5] Rui Chen. Research of information retrieval query expansion and realization based on concept map [D]. Northwestern University research, 2011: 19-24.

Google Scholar

[6] Weijiang Li, Weijiang Zhao, Xian Wang. Research of query expansion based on the context and of [J]. Research and development of computer, 2010, 47 (2): 301-303.

Google Scholar

[7] Zhenchun Li, Xiping Wang, Xiping Han. Review of phase correction in seismic data processing [J]. Advances in geophysics, 2011, 23 (3): 768-774.

Google Scholar

[8] Tianji Xu, Zhongmin Shen, Xuekang Wen. Application research of multi wavelet decomposition and reconstruction techniques [J]. Journal of Chengdu University of Technology (NATURAL SCIENCE EDITION), 2010, 37 (6): 108-113.

Google Scholar

[9] Liu Xu, Mao Guojun. Approximate mining algorithm of data stream frequent closed item sets [J]. Journal of electronics, 2010, 35 (5): 900-905.

Google Scholar

[10] Guohui Li, Hui Chen, Hui Yang. Prediction query algorithm based on the probability model [J]. Journal of computer science data stream, 2011, 35 (4): 66-69.

Google Scholar