ACM Home Page
Please provide us with feedback. Feedback
Query based optimal web site clustering using simulated annealing
Full text PdfPdf (151 KB)
Source International Conference on Information Integration and web-based Applications and Services archive
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services table of contents
Linz, Austria
SESSION: iiWAS 2008: Data mining and agents for information integration table of contents
Pages 271-278  
Year of Publication: 2008
ISBN:978-1-60558-349-5
Authors
Wookey Lee  Inha University, Incheon, Korea
Young Kuk Kim  Chungnam National University, Daejeon, Korea
Bok Sik Yoon  Hongik University, Seoul, Korea
Jiang Jin Xi  Yanbian University, Jinlin Province, China
Sponsor
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 41,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1497308.1497359
What is a DOI?

ABSTRACT

Clustering is a viable technique to deal with the scaling issue for the web documents, which has been known for complicated combinatorial optimization problem. It is hard to develop a generally applicable optimal algorithm on the web document clustering and classification for which a simulated annealing algorithm is developed. The web document classification problem is addressed as the problem of best describing match between a web query and a hypothesized web object. The normalized term frequency and inverse document frequency coefficient is used as a measure of the match. Test beds are generated on-line during the search by transforming web sites. As a result, web sites can be clustered optimally in terms of keyword vectors of corresponding web documents.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Edmonds, "Optimum Branching," Journal of Research of the National Bureau of Standards, 71B, pp. 233--240. 1967.
2
 
3
O. Etzioni, M. Cafarella, D. Downey, A. Popescu, T. Shaked, S. Soderland, D. Weld, and A. Yates, "Methods for Domain-Independent Information Extraction from the web: An Experimental Comparison," Proc. AAAI, pp. 391--398, 2004.
4
 
5
 
6
P. A. Gloor, and S. B. Dynes, "Cybermap - Visually Navigating the Web," Journal of Visual Languages and Computing, vol. 9, no. 3, pp. 319--336, 1998.
7
 
8
 
9
 
10
 
11
12
 
13
14
15
16
17
 
18
 
19
D. M. Pennock, G. W. Flake, S. Lawrence, E. J. Glover, and C. L. Giles, "Winners Don't Take All: Characterizing the Competition for Links on the Web," Computer Science, vol. 99, no. 8, pp. 5207--5211, 2002.
 
20
21
 
22
E. Ravasz, and A. L. Barabasi, "Hierarchical Organization in Complex Networks," PHYSICAL REVIEW, vol. 67, 2003.
 
23
R. Tarjan, "Enumeration of the Elementary Circuits of a Directed Graph," SIAM J. Computing, vol. 2, no. 3, pp. 211--216, 1973.
24
 
25
 
26
 
27
B. Yoon, "Finding the Number of Clusters and Various Experiments Based on ASA Clustering Method," Journal of KORMS, pp. 87--98, 2006.
 
28
Wookey Lee, S. Kang, S. Lim, M. Shin, and Y. Kim, "Adaptive Hierarchical Surrogate for Searching Web with Mobile Devices," IEEE Transactions on Consumer Electronics, Vol. 53, No. 2, pp. 796--803, 2007.
 
29
Wookey Lee, Seungkil Lim: Maximum Rooted Spanning Trees for the Web. OTM Workshops, LNCS, pp. 1873--1882, 2006.

Collaborative Colleagues:
Wookey Lee: colleagues
Young Kuk Kim: colleagues
Bok Sik Yoon: colleagues
Jiang Jin Xi: colleagues