├── LICENSE
├── README.md
├── data_helper.py
├── results
└── 2019-04-29-15-43-54
│ ├── acc.jpg
│ ├── confusion_matrix.jpg
│ └── loss.jpg
├── test.py
├── text_cnn.py
└── train.py
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # TextCNN
2 | TextCNN by TensorFlow 2.0.0 ( tf.keras mainly ).
3 | ## Software environments
4 | 1. tensorflow-gpu 2.0.0-alpha0
5 | 2. python 3.6.7
6 | 3. pandas 0.24.2
7 | 4. numpy 1.16.2
8 |
9 | ## Data
10 | - Vocabulary size: 3407
11 | - Number of classes: 18
12 | - Train/Test split: 20351/2261
13 |
14 | ## Model architecture
15 | ```
16 | Model: "model"
17 | __________________________________________________________________________________________________
18 | Layer (type) Output Shape Param # Connected to
19 | ==================================================================================================
20 | input_data (InputLayer) [(None, 128)] 0
21 | __________________________________________________________________________________________________
22 | embedding (Embedding) (None, 128, 512) 1744384 input_data[0][0]
23 | __________________________________________________________________________________________________
24 | add_channel (Reshape) (None, 128, 512, 1) 0 embedding[0][0]
25 | __________________________________________________________________________________________________
26 | convolution_3 (Conv2D) (None, 126, 1, 128) 196736 add_channel[0][0]
27 | __________________________________________________________________________________________________
28 | convolution_4 (Conv2D) (None, 125, 1, 128) 262272 add_channel[0][0]
29 | __________________________________________________________________________________________________
30 | convolution_5 (Conv2D) (None, 124, 1, 128) 327808 add_channel[0][0]
31 | __________________________________________________________________________________________________
32 | max_pooling_3 (MaxPooling2D) (None, 1, 1, 128) 0 convolution_3[0][0]
33 | __________________________________________________________________________________________________
34 | max_pooling_4 (MaxPooling2D) (None, 1, 1, 128) 0 convolution_4[0][0]
35 | __________________________________________________________________________________________________
36 | max_pooling_5 (MaxPooling2D) (None, 1, 1, 128) 0 convolution_5[0][0]
37 | __________________________________________________________________________________________________
38 | concatenate (Concatenate) (None, 1, 1, 384) 0 max_pooling_3[0][0]
39 | max_pooling_4[0][0]
40 | max_pooling_5[0][0]
41 | __________________________________________________________________________________________________
42 | flatten (Flatten) (None, 384) 0 concatenate[0][0]
43 | __________________________________________________________________________________________________
44 | dropout (Dropout) (None, 384) 0 flatten[0][0]
45 | __________________________________________________________________________________________________
46 | dense (Dense) (None, 18) 6930 dropout[0][0]
47 | ==================================================================================================
48 | Total params: 2,538,130
49 | Trainable params: 2,538,130
50 | Non-trainable params: 0
51 | __________________________________________________________________________________________________
52 | ```
53 |
54 | ## Model parameters
55 | - Padding size: 128
56 | - Embedding size: 512
57 | - Num channel: 1
58 | - Filter size: [3, 4, 5]
59 | - Num filters: 128
60 | - Dropout rate: 0.5
61 | - Regularizers lambda: 0.01
62 | - Batch size: 64
63 | - Epochs: 10
64 | - Fraction validation: 0.05 (1018 samples)
65 | - Total parameters: 2,538,130
66 |
67 | ## Run
68 | ### Train result
69 | Use 20351 samples after 10 epochs:
70 |
71 | | Loss | Accuracy | Val loss | Val accuracy |
72 | | --- | --- | --- | --- |
73 | | 0.1609 | 0.9683 | 0.3648 | 0.9185 |
74 | ### Test result
75 | Use 2261 samples:
76 |
77 | | Accuracy | Macro-Precision | Macro-Recall | Macro-F1 |
78 | | --- | --- | --- | --- |
79 | | 0.9363 | 0.9428 | 0.9310 | **0.9360** |
80 | ### Images
81 | #### Accuracy
82 | 
83 | #### Loss
84 | 
85 | #### Confusion matrix
86 | 
87 |
88 | ### Usage
89 | ```
90 | usage: train.py [-h] [-t TEST_SAMPLE_PERCENTAGE] [-p PADDING_SIZE]
91 | [-e EMBED_SIZE] [-f FILTER_SIZES] [-n NUM_FILTERS]
92 | [-d DROPOUT_RATE] [-c NUM_CLASSES] [-l REGULARIZERS_LAMBDA]
93 | [-b BATCH_SIZE] [--epochs EPOCHS]
94 | [--fraction_validation FRACTION_VALIDATION]
95 | [--results_dir RESULTS_DIR]
96 |
97 | This is the TextCNN train project.
98 |
99 | optional arguments:
100 | -h, --help show this help message and exit
101 | -t TEST_SAMPLE_PERCENTAGE, --test_sample_percentage TEST_SAMPLE_PERCENTAGE
102 | The fraction of test data.(default=0.1)
103 | -p PADDING_SIZE, --padding_size PADDING_SIZE
104 | Padding size of sentences.(default=128)
105 | -e EMBED_SIZE, --embed_size EMBED_SIZE
106 | Word embedding size.(default=512)
107 | -f FILTER_SIZES, --filter_sizes FILTER_SIZES
108 | Convolution kernel sizes.(default=3,4,5)
109 | -n NUM_FILTERS, --num_filters NUM_FILTERS
110 | Number of each convolution kernel.(default=128)
111 | -d DROPOUT_RATE, --dropout_rate DROPOUT_RATE
112 | Dropout rate in softmax layer.(default=0.5)
113 | -c NUM_CLASSES, --num_classes NUM_CLASSES
114 | Number of target classes.(default=18)
115 | -l REGULARIZERS_LAMBDA, --regularizers_lambda REGULARIZERS_LAMBDA
116 | L2 regulation parameter.(default=0.01)
117 | -b BATCH_SIZE, --batch_size BATCH_SIZE
118 | Mini-Batch size.(default=64)
119 | --epochs EPOCHS Number of epochs.(default=10)
120 | --fraction_validation FRACTION_VALIDATION
121 | The fraction of validation.(default=0.05)
122 | --results_dir RESULTS_DIR
123 | The results dir including log, model, vocabulary and
124 | some images.(default=./results/)
125 | ```
126 |
127 | ```
128 | usage: test.py [-h] [-p PADDING_SIZE] [-c NUM_CLASSES] results_dir
129 |
130 | This is the TextCNN test project.
131 |
132 | positional arguments:
133 | results_dir The results dir including log, model, vocabulary and
134 | some images.
135 |
136 | optional arguments:
137 | -h, --help show this help message and exit
138 | -p PADDING_SIZE, --padding_size PADDING_SIZE
139 | Padding size of sentences.(default=128)
140 | -c NUM_CLASSES, --num_classes NUM_CLASSES
141 | Number of target classes.(default=18)
142 | ```
143 | #### You need to know...
144 | 1. You need to alter `load_data_and_write_to_file` function in `data_helper.py` to match you data file;
145 | 2. This code used single channel input, you can use two channels from embedding vector, one is static and the other is dynamic. Maybe it is greater;
146 | 3. The model is saved by `hdf5` file;
147 | 4. Tensorboard is available.
--------------------------------------------------------------------------------
/data_helper.py:
--------------------------------------------------------------------------------
1 | import re
2 | import pandas as pd
3 | import csv
4 | from tensorflow.keras import preprocessing
5 | import numpy as np
6 | import json
7 |
8 |
9 | def text_preprocess(text):
10 | """
11 | Clean and segment the text.
12 | Return a new text.
13 | """
14 | text = re.sub(r"[\d+\s+\.!\/_,?=\$%\^\)*\(\+\"\'\+——!:;,。?、~@#%……&*()·¥\-\|\\《》〈〉~]",
15 | "", text)
16 | text = re.sub("[<>]", "", text)
17 | text = re.sub("[a-zA-Z0-9]", "", text)
18 | text = re.sub(r"\s", "", text)
19 | if not text:
20 | return ''
21 | return ' '.join(string for string in text)
22 |
23 |
24 | def load_data_and_write_to_file(data_file, train_data_file, test_data_file, test_sample_percentage):
25 | """
26 | Loads xlsx from files, splits the data to train and test data, write them to file.
27 | """
28 | # Load and clean data from files
29 | case_type = ['民事案件', '刑事案件', '行政案件', '赔偿案件', '执行案件']
30 | df = pd.read_excel(data_file, sheet_name=case_type, usecols=[3, 5], dtype=str)
31 | x_text, y = [], []
32 | for each_case_type in case_type:
33 | x_text += df[each_case_type]["自然段正文"].tolist()
34 | y += df[each_case_type]["正确分段标记"].tolist()
35 | x_new = []
36 | empty_idx = []
37 | for idx, each_text in enumerate(x_text):
38 | tmp = text_preprocess(each_text)
39 | if tmp:
40 | x_new.append(tmp)
41 | else:
42 | empty_idx.append(idx)
43 |
44 | # Generate labels
45 | y_new = []
46 | for idx, label in enumerate(y):
47 | if idx in empty_idx:
48 | continue
49 | label = label.split(',')[0]
50 | if label == '99':
51 | y_new.append(0)
52 | else:
53 | y_new.append(int(label))
54 |
55 | # Shuffle data and split data to train and test
56 | np.random.seed(323)
57 | np.random.shuffle(x_new)
58 | np.random.seed(323)
59 | np.random.shuffle(y_new)
60 | test_sample_index = -1 * int(test_sample_percentage * len(y_new))
61 | x_train, x_test = x_new[:test_sample_index], x_new[test_sample_index:]
62 | y_train, y_test = y_new[:test_sample_index], y_new[test_sample_index:]
63 |
64 | # Write to CSV file
65 | with open(train_data_file, 'w', newline='', encoding='utf-8-sig') as f:
66 | print('Write train data to {} ...'.format(train_data_file))
67 | writer = csv.writer(f)
68 | writer.writerows(zip(x_train, y_train))
69 | with open(test_data_file, 'w', newline='', encoding='utf-8-sig') as f:
70 | print('Write test data to {} ...'.format(test_data_file))
71 | writer = csv.writer(f)
72 | writer.writerows(zip(x_test, y_test))
73 |
74 |
75 | def preprocess(data_file, vocab_file, padding_size, test=False):
76 | """
77 | Text to sequence, compute vocabulary size, padding sequence.
78 | Return sequence and label.
79 | """
80 | print("Loading data from {} ...".format(data_file))
81 | df = pd.read_csv(data_file, header=None, names=["x_text", "y_label"])
82 | x_text, y = df["x_text"].tolist(), df["y_label"].tolist()
83 |
84 | if not test:
85 | # Texts to sequences
86 | text_preprocesser = preprocessing.text.Tokenizer(oov_token="")
87 | text_preprocesser.fit_on_texts(x_text)
88 | x = text_preprocesser.texts_to_sequences(x_text)
89 | word_dict = text_preprocesser.word_index
90 | json.dump(word_dict, open(vocab_file, 'w'), ensure_ascii=False)
91 | vocab_size = len(word_dict)
92 | # max_doc_length = max([len(each_text) for each_text in x])
93 | x = preprocessing.sequence.pad_sequences(x, maxlen=padding_size,
94 | padding='post', truncating='post')
95 | print("Vocabulary size: {:d}".format(vocab_size))
96 | print("Shape of train data: {}".format(np.shape(x)))
97 | return x, y, vocab_size
98 | else:
99 | word_dict = json.load(open(vocab_file, 'r'))
100 | vocabulary = word_dict.keys()
101 | x = [[word_dict[each_word] if each_word in vocabulary else 1 for each_word in each_sentence.split()] for each_sentence in x_text]
102 | x = preprocessing.sequence.pad_sequences(x, maxlen=padding_size,
103 | padding='post', truncating='post')
104 | print("Shape of test data: {}\n".format(np.shape(x)))
105 | return x, y
106 |
--------------------------------------------------------------------------------
/results/2019-04-29-15-43-54/acc.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ShaneTian/TextCNN/468a34f5f6a9b71abfe6d79056d6e97491bee119/results/2019-04-29-15-43-54/acc.jpg
--------------------------------------------------------------------------------
/results/2019-04-29-15-43-54/confusion_matrix.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ShaneTian/TextCNN/468a34f5f6a9b71abfe6d79056d6e97491bee119/results/2019-04-29-15-43-54/confusion_matrix.jpg
--------------------------------------------------------------------------------
/results/2019-04-29-15-43-54/loss.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/ShaneTian/TextCNN/468a34f5f6a9b71abfe6d79056d6e97491bee119/results/2019-04-29-15-43-54/loss.jpg
--------------------------------------------------------------------------------
/test.py:
--------------------------------------------------------------------------------
1 | import argparse
2 | from data_helper import preprocess
3 | from tensorflow.keras.models import load_model
4 | import tensorflow as tf
5 | import numpy as np
6 | from sklearn.metrics import confusion_matrix, accuracy_score, classification_report
7 | from sklearn.utils.multiclass import unique_labels
8 | import matplotlib.pyplot as plt
9 | import os
10 |
11 |
12 | def plot_confusion_matrix(y_true, y_pred, classes,
13 | normalize=False,
14 | title=None,
15 | cmap=plt.cm.Blues):
16 | """
17 | This function prints and plots the confusion matrix.
18 | Normalization can be applied by setting `normalize=True`.
19 | """
20 | if not title:
21 | if normalize:
22 | title = 'Normalized confusion matrix'
23 | else:
24 | title = 'Confusion matrix, without normalization'
25 |
26 | # Compute confusion matrix
27 | cm = confusion_matrix(y_true, y_pred)
28 | # Only use the labels that appear in the data
29 | classes = classes[unique_labels(y_true, y_pred)]
30 | if normalize:
31 | cm = cm.astype('float') / cm.sum(axis=1)[:, np.newaxis]
32 | print("Normalized confusion matrix")
33 | else:
34 | print('Confusion matrix, without normalization')
35 |
36 | print(cm)
37 |
38 | fig, ax = plt.subplots()
39 | im = ax.imshow(cm, interpolation='nearest', cmap=cmap)
40 | ax.figure.colorbar(im, ax=ax)
41 | # We want to show all ticks...
42 | ax.set(xticks=np.arange(cm.shape[1]),
43 | yticks=np.arange(cm.shape[0]),
44 | # ... and label them with the respective list entries
45 | xticklabels=classes, yticklabels=classes,
46 | title=title,
47 | ylabel='True label',
48 | xlabel='Predicted label')
49 |
50 | # Rotate the tick labels and set their alignment.
51 | plt.setp(ax.get_xticklabels(), rotation=45, ha="right",
52 | rotation_mode="anchor")
53 |
54 | # Loop over data dimensions and create text annotations.
55 | fmt = '.2f' if normalize else 'd'
56 | thresh = cm.max() / 2.
57 | for i in range(cm.shape[0]):
58 | for j in range(cm.shape[1]):
59 | ax.text(j, i, format(cm[i, j], fmt),
60 | ha="center", va="center",
61 | color="white" if cm[i, j] > thresh else "black")
62 | fig.tight_layout()
63 | return ax
64 |
65 |
66 | def test(model, x_test, y_test):
67 | print("Test...")
68 | y_pred_one_hot = model.predict(x=x_test, batch_size=1, verbose=1)
69 | y_pred = tf.math.argmax(y_pred_one_hot, axis=1)
70 |
71 | plot_confusion_matrix(y_test, y_pred, np.arange(args.num_classes))
72 | plt.savefig(os.path.join(args.results_dir, "confusion_matrix.pdf"))
73 |
74 | print('\nTest accuracy: {}\n'.format(accuracy_score(y_test, y_pred)))
75 | print('Classification report:')
76 | target_names = ['class {:d}'.format(i) for i in np.arange(args.num_classes)]
77 | print(classification_report(y_test, y_pred, target_names=target_names, digits=4))
78 |
79 |
80 | if __name__ == '__main__':
81 | parser = argparse.ArgumentParser(description='This is the TextCNN test project.')
82 | parser.add_argument('results_dir', type=str, help='The results dir including log, model, vocabulary and some images.')
83 | parser.add_argument('-p', '--padding_size', default=128, type=int, help='Padding size of sentences.(default=128)')
84 | parser.add_argument('-c', '--num_classes', default=18, type=int, help='Number of target classes.(default=18)')
85 | args = parser.parse_args()
86 | print('Parameters:', args)
87 |
88 | x_test, y_test = preprocess("./data/test_data.csv", os.path.join(args.results_dir, "vocab.json"),
89 | args.padding_size, test=True)
90 | print("Loading model...")
91 | model = load_model(os.path.join(args.results_dir, 'TextCNN.h5'))
92 | test(model, x_test, y_test)
93 |
--------------------------------------------------------------------------------
/text_cnn.py:
--------------------------------------------------------------------------------
1 | from tensorflow import keras
2 |
3 |
4 | def TextCNN(vocab_size, feature_size, embed_size, num_classes, num_filters,
5 | filter_sizes, regularizers_lambda, dropout_rate):
6 | inputs = keras.Input(shape=(feature_size,), name='input_data')
7 | embed_initer = keras.initializers.RandomUniform(minval=-1, maxval=1)
8 | embed = keras.layers.Embedding(vocab_size, embed_size,
9 | embeddings_initializer=embed_initer,
10 | input_length=feature_size,
11 | name='embedding')(inputs)
12 | # single channel. If using real embedding, you can set one static
13 | embed = keras.layers.Reshape((feature_size, embed_size, 1), name='add_channel')(embed)
14 |
15 | pool_outputs = []
16 | for filter_size in list(map(int, filter_sizes.split(','))):
17 | filter_shape = (filter_size, embed_size)
18 | conv = keras.layers.Conv2D(num_filters, filter_shape, strides=(1, 1), padding='valid',
19 | data_format='channels_last', activation='relu',
20 | kernel_initializer='glorot_normal',
21 | bias_initializer=keras.initializers.constant(0.1),
22 | name='convolution_{:d}'.format(filter_size))(embed)
23 | max_pool_shape = (feature_size - filter_size + 1, 1)
24 | pool = keras.layers.MaxPool2D(pool_size=max_pool_shape,
25 | strides=(1, 1), padding='valid',
26 | data_format='channels_last',
27 | name='max_pooling_{:d}'.format(filter_size))(conv)
28 | pool_outputs.append(pool)
29 |
30 | pool_outputs = keras.layers.concatenate(pool_outputs, axis=-1, name='concatenate')
31 | pool_outputs = keras.layers.Flatten(data_format='channels_last', name='flatten')(pool_outputs)
32 | pool_outputs = keras.layers.Dropout(dropout_rate, name='dropout')(pool_outputs)
33 |
34 | outputs = keras.layers.Dense(num_classes, activation='softmax',
35 | kernel_initializer='glorot_normal',
36 | bias_initializer=keras.initializers.constant(0.1),
37 | kernel_regularizer=keras.regularizers.l2(regularizers_lambda),
38 | bias_regularizer=keras.regularizers.l2(regularizers_lambda),
39 | name='dense')(pool_outputs)
40 | model = keras.Model(inputs=inputs, outputs=outputs)
41 | return model
42 |
--------------------------------------------------------------------------------
/train.py:
--------------------------------------------------------------------------------
1 | import argparse
2 | import os
3 | import data_helper
4 | from text_cnn import TextCNN
5 | from tensorflow import keras
6 | import tensorflow as tf
7 | from pprint import pprint
8 | import time
9 |
10 |
11 | def train(x_train, y_train, vocab_size, feature_size, save_path):
12 | print("\nTrain...")
13 | model = TextCNN(vocab_size, feature_size, args.embed_size, args.num_classes,
14 | args.num_filters, args.filter_sizes, args.regularizers_lambda, args.dropout_rate)
15 | model.summary()
16 | parallel_model = keras.utils.multi_gpu_model(model, gpus=2)
17 | parallel_model.compile(tf.optimizers.Adam(), loss='categorical_crossentropy',
18 | metrics=['accuracy'])
19 | keras.utils.plot_model(model, show_shapes=True, to_file=os.path.join(args.results_dir, timestamp, "model.pdf"))
20 | y_train = tf.one_hot(y_train, args.num_classes)
21 | tb_callback = keras.callbacks.TensorBoard(os.path.join(args.results_dir, timestamp, 'log/'),
22 | histogram_freq=0.1, write_graph=True,
23 | write_grads=True, write_images=True,
24 | embeddings_freq=0.5, update_freq='batch')
25 | history = parallel_model.fit(x=x_train, y=y_train, batch_size=args.batch_size, epochs=args.epochs,
26 | callbacks=[tb_callback], validation_split=args.fraction_validation, shuffle=True)
27 | print("\nSaving model...")
28 | keras.models.save_model(model, save_path)
29 | pprint(history.history)
30 |
31 |
32 | if __name__ == '__main__':
33 | parser = argparse.ArgumentParser(description='This is the TextCNN train project.')
34 | parser.add_argument('-t', '--test_sample_percentage', default=0.1, type=float, help='The fraction of test data.(default=0.1)')
35 | parser.add_argument('-p', '--padding_size', default=128, type=int, help='Padding size of sentences.(default=128)')
36 | parser.add_argument('-e', '--embed_size', default=512, type=int, help='Word embedding size.(default=512)')
37 | parser.add_argument('-f', '--filter_sizes', default='3,4,5', help='Convolution kernel sizes.(default=3,4,5)')
38 | parser.add_argument('-n', '--num_filters', default=128, type=int, help='Number of each convolution kernel.(default=128)')
39 | parser.add_argument('-d', '--dropout_rate', default=0.5, type=float, help='Dropout rate in softmax layer.(default=0.5)')
40 | parser.add_argument('-c', '--num_classes', default=18, type=int, help='Number of target classes.(default=18)')
41 | parser.add_argument('-l', '--regularizers_lambda', default=0.01, type=float, help='L2 regulation parameter.(default=0.01)')
42 | parser.add_argument('-b', '--batch_size', default=64, type=int, help='Mini-Batch size.(default=64)')
43 | parser.add_argument('--epochs', default=10, type=int, help='Number of epochs.(default=10)')
44 | parser.add_argument('--fraction_validation', default=0.05, type=float, help='The fraction of validation.(default=0.05)')
45 | parser.add_argument('--results_dir', default='./results/', type=str, help='The results dir including log, model, vocabulary and some images.(default=./results/)')
46 | args = parser.parse_args()
47 | print('Parameters:', args, '\n')
48 |
49 | if not os.path.exists(args.results_dir):
50 | os.mkdir(args.results_dir)
51 | timestamp = time.strftime("%Y-%m-%d-%H-%M", time.localtime(time.time()))
52 | os.mkdir(os.path.join(args.results_dir, timestamp))
53 | os.mkdir(os.path.join(args.results_dir, timestamp, 'log/'))
54 |
55 | if not os.path.exists("./data/train_data.csv") or not os.path.exists("./data/test_data.csv"):
56 | data_helper.load_data_and_write_to_file("./data/fenduan_clean.xlsx", "./data/train_data.csv",
57 | "./data/test_data.csv", args.test_sample_percentage)
58 |
59 | x_train, y_train, vocab_size = data_helper.preprocess("./data/train_data.csv",
60 | os.path.join(args.results_dir, timestamp, "vocab.json"),
61 | args.padding_size)
62 | train(x_train, y_train, vocab_size, args.padding_size, os.path.join(args.results_dir, timestamp, 'TextCNN.h5'))
63 |
--------------------------------------------------------------------------------