Download - Academy Publisher

More documents

Recommendations

Info

However, most works in Web information credibility were published after 2005. There are some prototypes in Web information credibility evaluation, among which the most famous ones are WISDOM (Akamine et al., 2009) and HontoSearch (Yamamoto and Tanaka, 2009). WISDOM extracts information from Web pages and clusters them according to senders and opinions. It is designed as a computer-aided tool to help users to determine the credibility of querying topics. HontoSearch is a Web Q/A system. It allows users to input a query about some fact and delivers the clustered analysis on the given fact. It is also a computer-aided system to help users evaluate information credibility. Besides, HONCode (Fritch, 2003) and MedPICS (Eysenbach, 2000) are two prototypes in the medical domain which also support Web information credibility evaluation. HONCode is built by the NGO Health on the Net Foundation. It can help users to find the credible medical websites, which are trusted by some third-party authoritative organization. The third-partybased evaluation method is very common is some specific areas, such as electronic commerce. MedPICS allows website owner to add some trust tags in the Web pages. And then users can filter Web information based on the trust tags in Web pages. For example, they can require that only the information whose trust tags are higher that a certain value be returned to them. Previous works usually focus on different contents in the Web. Most researchers paid attention to the Web news credibility, searched results credibility, and products information credibility. Those works are generally based on Web pages and try to compute the credibility of Web pages. For example, Google News (Google, 2005) uses the trustiness of news posters to evaluate the news credibility. Some news websites adopt a vote-based approach to measure the news credibility, such as www.126.com and www.sohu.com. There are also some works concerning Web information quality and the credibility of Web information sources. A lot of people also make investigation on Web information credibility. For example, a survey in 2004, which is focused in the electronic commerce area, shown that about 26% American posted comments on products in the Web (Rainie and Hitlin, 2007), which indicates that users’ comments is a key factor in the information credibility evaluation. The basic methods used in Web information credibility evaluation can be divided into four types, which are the Checklist method, the cognitive authority method, the iterative model, and the credibility seal programs. The Checklist method uses a checklist to perform a user survey and then to determine the information credibility. This method is usually not practical in real applications. For example, some checklists contain too many questions that will consume too much time of users (Metzger, 2007). The cognitive authority method pays much attention to the authority of information. It is similar with the checklist method, except that it usually utilizes some automatic tools. For example, it suggests users use the Whois, Traceoute, and other tools to evaluate the authority of the information senders and websites. The iterative model evaluates information credibility through three steps. First, it checks the appearance of the website. Second, it measures some detailed factors, including the professional level, the trustable level, the freshness, precise, and relevance to users’ needs. Finally, users are required to mark the evaluated results. The similarity between the iterative model and the Checklist method is that both of them provide some criteria for users to mark the information credibility. The difference between them is that the iterative model pays more attention to the importance of the information receiver in the evaluation process. The credibility seal program is much different from other three methods. It provides some credibility seal program to help users to find credible sources in the Web. For example, the HONCode can help users to find trusted medical websites (Fritch, 2003). However, this method is usually restricted in certain areas due to the huge amount of Web information. results III. WEB-BASED COMPETITIVE INTELLIGENCE EXTRACTION AND CREDIBILITY EVALUATION User interface query Query processing Competitive intelligence Domain dictionary Focused Crawler Social network model Credibility evaluation Competitive intelligence extraction Web pages Ontology Rules Figure 1. A Framework of Web-based Competitive Intelligence Extraction and Credibility Evaluation According to practical applications, competitive intelligence must be connected to some specific domain. For example, many competitive intelligence softwares provide intelligence analysis towards a given domain. Based on this assumption, we propose a domainconstrained system to extract and evaluate Web competitive intelligence (as shown in Fig.1). The system consists of four modules, which are the competitive intelligence extraction module, the credibility evaluation module, the query processing module, and the user interface. The basic running process of the system is as follows. First we use a focused crawler to collect Web pages about a specific application domain. Then we extract competitive intelligence from Web pages according to some rules, the competitive intelligence 194
ontology, and the domain dictionary. After that, the credibility of the extracted competitive intelligence is evaluated based on a defined social-network-based credibility model. When users submit queries about competitive intelligence through the user interface, the query processing model will retrieve appropriate results from the competitive intelligence database. The main function of the competitive intelligence extraction module is to extract domain-constrained competitive intelligence from Web pages and further to deliver them to the credibility evaluation module. We use an entity-based approach in this module to extract competitive intelligence, which will be discussed in the next section. The credibility evaluation module adopts the socialnetwork-based method to evaluate competitive intelligence credibility. The credibility of competitive intelligence is influenced by a lot of factors. These factors are classified into two types in our paper, which are the inner-site factors and inter-site factors. Then we use different algorithms to evaluate the competitive intelligence credibility according each type of factors. Finally we will integrate the both results and make a comprehensive evaluation on the competitive intelligence credibility. The user interface supports keyword-based queries on competitive intelligence. Users are allowed to input topics, time, or locations as query conditions. The query processing module aims at returning competitive intelligence related with given topics or other conditions. Competitive intelligence workers can further process the returned results and produce integrated competitive intelligence. This module contains two procedures. The first one is a database retrieval procedure, and the second is clustered visualization of the results. The system provides several ways of clustered visualization, including time-based clustering, locationbased clustering, and topic-based clustering. IV. A SPATIOTEMPORAL-EVOLUTION-BASED APPROACH TO CREDIBILITY EVALUATION Most Web pages contain time and location information. That information is useful to evaluate the credibility of Web-based competitive intelligence. Our approach consists of two ideas. The first idea is to construct a timeline for Web-based competitive intelligence, and further to develop algorithms to determine the credibility of Web-based competitive intelligence. The second idea is to construct a location distribution of related Web pages, which contribute the extraction of Web-based competitive intelligence. And then we use the location distribution to measure the credibility of Web-based competitive intelligence. Fig.3 and Fig.4 shows the two ideas. In Fig.3, we see that the number of Web pages related to a certain competitive intelligence element increased sharply in July, 2009, based on which we can infer that this element is very possible to be true from July, 2009. While in Fig.4, we find that in July, 2009, the IP locations of related Web pages are mostly in China. Suppose that the competitive intelligence is about China, we can draw the conclusion that in July, 2009, the competitive intelligence gained the most attention in China, so it is very possible that the competitive intelligence is credible. Figure 2. The timeline evaluation of Web-based competitive intelligence Figure 3. The location distribution of Web-based competitive intelligence V. CONCLUSIONS AND FUTURE WORK In this paper we present a framework of extracting and evaluating Web-based competitive intelligence. Our future work will concentrate on the design and implementation of the algorithms mentioned in the paper and aim at implementing a prototype and conducting experimental study. VI. ACKNOWLEDGEMENT This work is supported by the Open Projects Program of National Laboratory of Pattern Recognition, the Key Laboratory of Advanced Information Science and Network Technology of Beijing, and the National Science Foundation of China under the grant no. 60776801 and 70803001. REFERENCES [1] Akamine, S., Kawahara, D., Kato, Y., et al., (2009) WISDOM: A Web Information Credibility Analysis System, Proc. of the ACL-IJCNLP 2009 Software Demonstrations, Suntec, Singapore, pp. 1-4 [2] Alfarez, A., Hailes S., (1999) Relying On Trust to Find Reliable Information, Proc. of International Symposium on Database, Web and Cooperative Systems (DWA-COS) [3] Deng, D., Luo, L., (2007) An Exploratory Discuss of New Ways for Competitive Intelligence on WEB 2.0, In W. Wang (ed.), Proc. of IFIP International Conference on e- 195
Page 1 and 2:
Proceedings The Second Internationa
Page 3 and 4:
Table of Contents Message from the
Page 5 and 6:
Zuming Xiao, Zhan Guo, Bin Tan, and
Page 7 and 8:
Message from the Symposium Chairs T
Page 9 and 10:
Second International Symposium on N
Page 11 and 12:
ISBN 978-952-5726-09-1 (Print) Proc
Page 13 and 14:
model that can deal with time serie
Page 15 and 16:
ISBN 978-952-5726-09-1 (Print) Proc
Page 17 and 18:
training for the Wushu competition
Page 19 and 20:
ISBN 978-952-5726-09-1 (Print) Proc
Page 21 and 22:
information, called weak uncertain
Page 23 and 24:
Student side Student side Student s
Page 25 and 26:
ISBN 978-952-5726-09-1 (Print) Proc
Page 27 and 28:
If we define element of student as
Page 29 and 30:
ISBN 978-952-5726-09-1 (Print) Proc
Page 31 and 32:
QoS, each frame data is divided int
Page 33 and 34:
ISBN 978-952-5726-09-1 (Print) Proc
Page 35 and 36:
for Imaging Two and Three Phase Flo
Page 37 and 38:
ISBN 978-952-5726-09-1 (Print) Proc
Page 39 and 40:
A. Profiling&following control algo
Page 41 and 42:
Research and Realization about Conv
Page 43 and 44:
PDF document structure is a tree st
Page 45 and 46:
ISBN 978-952-5726-09-1 (Print) Proc
Page 47 and 48:
support 10 Mb / s. But ENC28J60 onl
Page 49 and 50:
ISBN 978-952-5726-09-1 (Print) Proc
Page 51 and 52:
condition the first byte output of
Page 53 and 54:
ISBN 978-952-5726-09-1 (Print) Proc
Page 55 and 56:
According to maximum membership deg
Page 57 and 58:
ISBN 978-952-5726-09-1 (Print) Proc
Page 59 and 60:
ubber according to the mass ratio o
Page 61 and 62:
Ⅲ. AN IMPROVED DNA ALGORITHM FOR
Page 63 and 64:
Ⅴ.CONCLUSION REMARKS DNA computer
Page 65 and 66:
its first child q 1 on the left, th
Page 67 and 68:
chains can greatly improve efficien
Page 69 and 70:
II. RELATED WORK A. Mobile Service
Page 71 and 72:
special services. SOAP is used to b
Page 73 and 74:
detection methods of DDoS attacks m
Page 75 and 76:
Step4 calculate the new subordinate
Page 77 and 78:
Figure 1. An analysis of the partit
Page 79 and 80:
ISBN 978-952-5726-09-1 (Print) Proc
Page 81 and 82:
The preceding three formulas can be
Page 83 and 84:
ISBN 978-952-5726-09-1 (Print) Proc
Page 85 and 86:
And the decay speed of buffer seque
Page 87 and 88:
ISBN 978-952-5726-09-1 (Print) Proc
Page 89 and 90:
distance of view point. Given that
Page 91 and 92:
ISBN 978-952-5726-09-1 (Print) Proc
Page 93 and 94:
Ⅳ. EVALUATION OF BLENDED LEARNING
Page 95 and 96:
ISBN 978-952-5726-09-1 (Print) Proc
Page 97 and 98:
symmetric with respect to the origi
Page 99 and 100:
ISBN 978-952-5726-09-1 (Print) Proc
Page 101 and 102:
each sample belongs to each categor
Page 103 and 104:
ISBN 978-952-5726-09-1 (Print) Proc
Page 105 and 106:
A. Data Preparing To generate our t
Page 107 and 108:
ISBN 978-952-5726-09-1 (Print) Proc
Page 109 and 110:
oth α and β . determination of Qu
Page 111 and 112:
ISBN 978-952-5726-09-1 (Print) Proc
Page 113 and 114:
Strong earthquake 0.1< M L
Page 115 and 116:
ISBN 978-952-5726-09-1 (Print) Proc
Page 117 and 118:
indirect causes, and the logical re
Page 119 and 120:
egression. Granger causality test i
Page 121 and 122:
B. Evaluation We have evaluated thi
Page 123 and 124:
used as a source and neighboring ce
Page 125 and 126:
Figure 3. Drainage networks generat
Page 127 and 128:
Combinational logic unit failures i
Page 129 and 130:
Tabal.1 Combinational fault logic t
Page 131 and 132:
under the endorsement of both the m
Page 133 and 134:
TABLE I. DESCRIPTION OF PROPOSITION
Page 135 and 136:
Figure 2. The process of the invers
Page 137 and 138:
Figure 9. (a)the original image.(b)
Page 139 and 140:
ISBN 978-952-5726-09-1 (Print) Proc
Page 141 and 142:
In order to reduce to the number of
Page 143 and 144:
ISBN 978-952-5726-09-1 (Print) Proc
Page 145 and 146:
that studying being going to be to
Page 147 and 148:
Reference[10] analyzed the evolutio
Page 149 and 150:
module, communication module, apper
Page 151 and 152:
After the comprehensive performance
Page 153 and 154: system testing can be seen that the
Page 155 and 156: III. AUTONOMIC RESOURCE ALLOCATION
Page 157 and 158: The QoE i (T i ) is the ith user’
Page 159 and 160: ISBN 978-952-5726-09-1 (Print) Proc
Page 161 and 162: nodes will be formed one cluster, t
Page 165 and 166: Where n is the number of data point
Page 169 and 170: Keyboard event Application User mod
Page 173 and 174: SQL Azure will eventually include a
Page 177 and 178: The nodes in the suffix tree are dr
Page 179 and 180: [3] Y. Li, S. M. Chung, and J. D. H
Page 181 and 182: some drilling fluid produces hydrog
Page 183 and 184: "normalization", whose membership b
Page 185 and 186: and minimum structural elements in
Page 187 and 188: esults of the spatial transform par
Page 189 and 190: B. Research on protocol actions Com
Page 191 and 192: ACKNOWLEDGMENT This work is funded
Page 193 and 194: A. Problem Description In a small b
Page 195 and 196: [4] Huang, Hung, and J. Y. jen Hsu.
Page 197 and 198: Further by calculating, the followi
Page 199 and 200: TABLE II. THE CONCENTRATION BETWEEN
Page 201 and 202: private key that obtained by using
Page 203: ISBN 978-952-5726-09-1 (Print) Proc
Page 209 and 210: Eq.4 is NP-hard and can be solved b
Page 213 and 214: Where: G i is the selection field o
Page 215 and 216: If there is X j in a generation, wh
Page 217 and 218: Theorem 2.4([10]). Let L 1 and L 2
Page 219 and 220: The relation between the lattice im
Page 221 and 222: Figure 2. Example of single-step de
Page 223 and 224: evocation and the fourth group stor
Page 225 and 226: focused mainly on rule-based forms
Page 227 and 228: Ⅵ. CONCLUSION Figure 6. The Flask
Page 229 and 230: EDCF in comparison with DCF, has so
Page 231 and 232: B. Simulation results and analysis
Page 235 and 236: in routing table. When search resou
Page 239 and 240: others through the selective emotio
Page 241 and 242: such as weather information, techno
Page 243 and 244: the opening window, a related page
Page 245 and 246: 1) Process context storage areas. I
Page 247 and 248: V. CONCLUSION In this thesis, sCPU-
Page 249 and 250: main types of horizontal search env
Page 251 and 252: Enterprise Portal security provides
Page 253 and 254: () t = [ S () t S () t ] T N S ,...
Page 255 and 256:
[2] Kumaravel, N., and Kavitha, V.,
Page 257 and 258:
output, so BP network has been wide
Page 259 and 260:
input to the artificial neural netw
Page 261 and 262:
(2) In a process (tokens from outsi
Page 263 and 264:
The reduction process consists of t
Page 265 and 266:
all eight normal vectors are identi
Page 267 and 268:
is B object , and the number of emp
Page 269 and 270:
xi, j y' = εα ( (1 + tanh( )) −
Page 271 and 272:
Error 8000 7000 6000 5000 4000 3000
Page 273 and 274:
Architecture (AMBA) a new bus archi
Page 275 and 276:
In order to ensure the smooth proce
Page 277 and 278:
ISBN 978-952-5726-09-1 (Print) Proc
Page 279 and 280:
In this paper, we adopt two Sobel o
Page 281 and 282:
ISBN 978-952-5726-09-1 (Print) Proc
Page 283 and 284:
four layers.The far right of the gr
Page 285 and 286:
ISBN 978-952-5726-09-1 (Print) Proc
Page 287 and 288:
TABLE II. OPERATIONAL EMPLOYEE TABL
Page 289 and 290:
A. Object-relational Type To audit
Page 291 and 292:
to execution time. Also, DBA would
Page 293 and 294:
Liping Chen .......................
show all

Download - Academy Publisher

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?